C++

SIDE NOTE: For 2 C) please use expression tree.

2. (A). Show the contents of stack and que after the following algorithm is executed. Input sequence: 10, 10, 1, 2, 3, 10, 10, 10,5, 6, 10 loop ( not end of input allocate (data and store its address in dataPtr) read data using dataPtr if data not 10) stack.push ( dataPtr else loop (not stack.isEmpty)) stack.pop (dataPtr) que.enqueue ( dataPtr end loop end if end loop (B). Explain why the below algorithm has a memory leak (C). Give the postfix form of the following expression either using a stack OR an expression tree. 2*(A+(3-B)%(4+C))-D