Short Answer Question: (2 Questions each) 1-Drow the digraph represented by the adjacency matrix r0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 LO 0 0 0 0 0 0 0 0 2. Draw the binary search tree 8,3,10,1,6,14,4,7,13 Give the inorder traversal b. Delete 3 Insert 9 C