Answer all the questions in the space provided. der each question. ‘ou may answer a rough work, with each node cont more than once. Thus given the input 34- 40-55-55 62-78, it should return 34=40~62=78 node * duplicate( node *A) { pod’ wee nok b= AY # (b== NOLL) £ used CO \n Embty Loe aadusen |}path i: path 2: path 3: path ai For this problem, we will be concemed with the product of the values of such a path -= for ‘example, the product of the values on the 5-4-11-7 path is 5* 4. {1 * 7m [540,: 2 expression into postfix notation using a stack. Show the ‘characteris read from the expression. are annons ja te chaeackn 1G *2))*3) oe 5A a 4 ES sakeu sats void wonder (node *p) { wonder ( p=> left); if (p> right != NULL || p-> left = NULL){ cout << p-> data<<* 43} wonder (p—> right);}fe drafts Live we ey \o0 | So ye dele Xe be overs Raw 2 Jere kos West : wren anak Awind modes = ie DH Kae N64 B24 64 — Ware ws) gels 7. [5] Indicate how the list below will change when we call the following routine firsi> 51-55-92. 40 - 62 ~84~78 Sa eas ie