a) Explain how to build a binary search tree by inserting each number to the tree one by one from left to right. All unspecified empty weights are infinity. where w1=d1+1,w2=d7+5,w3=d8+3, w4= d 9+1, w 5=d7+8, w6= d8+2,w7=d7+3,w8=d8+1,w9=d9+1 Find a shortest path from 0 to 7 with Dijkstra's Algorithm by describing and showing all intermediate results, together with S and Q sets