final Data Structure Q$1$ Write a method that return true if Binary search Tree is minheap or Maxheap otherwise return false Q$2$ you have an array write it after $4$ swaps by selection and Quick and insartion sort $.$ Q$3$ write a code and the shape of the binary tree after balancing it by avl Tree Q$4$ you have N room from $0$ to N$-1$ and $($adjMatrix$)$ represent : if a$[$i$][$j$]==1$ that mean in room i there is a key for the room i modify the adjmatrix to minmize the number of keys but you can still go to all of rooms starting from one $,$ Note that the order is not important you can go from $1$ to $2$ to $3$ to $4$ or $1$ to $4$ to $1$ to $3$ to $2$