In this problem assume that P has just been proven equal to NP, and so you have a polynomial time algorithm A that decides 3-SAT; that is, it takes in a logical formula written in 3-SAT form ((x_1 Vx_2 V-x_3) (x_1 x_2 -x_3) ...), and it tells you whether or not a satisfying assignment exists for that formula (you also have a million dollars because you solved P = NP, but that's a different story...) So you have an algorithm A that tells you whether or not a satisfying solution exists for a logic formula, but you don't have one that tells you what exactly that satisfying solution is. For this problem, write a polynomial-time algorithm that finds a satisfying solution to an instance of 3-SAT, given that you have a polynomial-time algorithm A you can run that tells you whether or not a solution exists to an instance of 3-SAT