help please

help me please

Algorithm 1.3.1 (Finding the Parse Tree of a Formula). Make sure that all the brackets are in the formula as the definition of a formula, strictly followed, requires. Then, put a pair of brackets around every propositional variable and I too for example, the formula pa q - 1 becomes f(ip) A (iq) (1.). Vov, start with a me mode: we declare it to be the current node Start reading through the formula one simbol at a time. Whenever you hit a (.create a new node and make the cuild of the Current node. Change the current nodi 1 (a) Using Algorithm 1.3.1, find the parse tree of the following formula, showing every 10th step in your working. (-(( ps) A (-((=((q) Ar)) (rV (-s)))))) (b) Write the formula from part la in Polish notation. (c) Write the formula from part la in reverse Polish notation. 2. @ Find a parse tree for the formula written in Polish notation as Aparp=> 1 Vr 9p and (6) write the formula in ordinary notation. 3. (a) Give an example of a formula in standard form whose reverse Polish form is not its Polish form in reverse. (b) Give an example of a formula in standard form whose reverse Polish form is its Polish form in reverse. (c) Give an example of a formula in standard form with no negation symbols (ie. --), with occurences of both of the propositional variabls p and y, and whose reverse Polish form is ts Polish form in reverse