Problem #$1($This problem does not require programming in java.$)$

Write your own pseudocode algorithm to traverse a binary tree in a level$-$order. $(2$ marks$)$

Write your own pseudocode algorithm that construct an expression tree from a prefix

expression. $(2$ marks$)$

Draw an expression tree for the following expression: $(2$ marks$)$

$(8-3)**6+(3+(7-2))$

Write your own pseudocode algorithm that builds a mirror three such that the nodes are in

reverse order. For example, the right tree below is the mirror tree of the left tree: $(4$ marks$)$

One such algorithm is to traverse the original tree in a pre$-$order and build a new tree with

inverse properties: all the values less than the root should be inserted to the right side and all

the values greater than the root should be inserted on the left side.

Please provide simple pseudocode which is easier to understand.Java is the programming language