Q$1($Heap ADT$)[20$ Points$]$:

Show step by stem how We can add a new element with a key of $91$ to the heap shown below. That is$,$

show how the new node is added and how it is moved until it reaches an acceptable location. $($draw the

heap after each step$)$

Q$2($Tree ADT$)[20$ Points$]$:

Give the Preorder and Inorder traversals $($print the numbers separated by comma $\text{'},\text{'})$ of the tree below:

Preorder:

Inorder: