Give pseudo code for a polynomial-time verification algorithm A(x, t) for SAT. Assume that x is a Boolean formula in the variables x_1, x_2, ..., x_n, and that the certificate t is an array of n true/false values representing the assignment to be verified. Give an asymptotic estimate of the running time of your algorithm as a function of n, and state any assumptions you make about the formula. (This problem shows that SAT element NP)