Question 6. a/ Using Kruskal's algorithm, give the minimum spanning tree (draw it on the following figure with another colour) and write all the steps (add ) and ignorel ?). Son b/ Solve the same using Prim algorithm (show the steps as seen in class). Question 7. Given the following graph, find the path from A using Disktra's algorithm (show the steps as seen in class) Question 8. Write a pseudo code of an algorithm that takes as input the root and returns the number of items in a BST. Question 9. a/Draw what a binary search tree would look like if the following values were added to an initially empty tree in this order:50; 20; 75: 98: 80; 31: 150; 39; 23; 11; 77 b/ Write the algorithm (pseudo-code) that you used to create this BST