In the mine consis- tency game, you are given a graph G along with numbers labeling some of G's nodes. You must determine whether a placement of mines on the remaining nodes is possible, so that any node v that is labeled m has exactly m neighboring nodes containing mines. (a) Formulate this problem as a language MCP and show that it is in NP. (b) Show that 3SAT < MCP. (Note that together with part (a) this means that MCP is NP-complete.)