Please Solve this.ASAP

COMPUTER SCIENCE THEORY 1. Consider the following (high-level) description of a TM T, which expects an input of the form (G), encoding a directed graph G T: "On input (G): 1. Check that (G) is an encoding of a directed graph with at most one outgoing edge from each node. If it's not of this form, reject 2. Selected the first node of G and mark it with two marks, corresponding to 'visited and to 'current' 3. If the node u marked as 'current' has an outgoing edge to another node v, move the 'current' mark from u to v. Mark v as 'visited' (if it's not already marked this way). Go to 3 4. If the node u marked as 'current' does not have any outgoing edge, scan the input for the first node v that is not marked as 'visited'. If there is such a v, move the 'current' mark from u to v, mark v as visited, and go to i3 If there is no such v, accept." (a) What is the language recognized by T? (b) Is T a recognizer? Explain your answer. If your answer is no, show a recognizer for the same language (c) Is T a decider? Explain your answer. If your answer is no, show a decider for the same language. COMPUTER SCIENCE THEORY 1. Consider the following (high-level) description of a TM T, which expects an input of the form (G), encoding a directed graph G T: "On input (G): 1. Check that (G) is an encoding of a directed graph with at most one outgoing edge from each node. If it's not of this form, reject 2. Selected the first node of G and mark it with two marks, corresponding to 'visited and to 'current' 3. If the node u marked as 'current' has an outgoing edge to another node v, move the 'current' mark from u to v. Mark v as 'visited' (if it's not already marked this way). Go to 3 4. If the node u marked as 'current' does not have any outgoing edge, scan the input for the first node v that is not marked as 'visited'. If there is such a v, move the 'current' mark from u to v, mark v as visited, and go to i3 If there is no such v, accept." (a) What is the language recognized by T? (b) Is T a recognizer? Explain your answer. If your answer is no, show a recognizer for the same language (c) Is T a decider? Explain your answer. If your answer is no, show a decider for the same language