I. Using the breadth-first search algorithm with the vertex ordering eachgbdfi find the minimal spanning tree for the following graph and show the contents of the queue for each vertex visit ( 20 points). II. Using the graph of Question I, use the depth-first search algorithm with the vertex ordering eachgbdfi find the minimal spanning tree and show the contents of the stack for each vertex visit (20 points). III. Distinguish the breadth-first search algorithm from depth-first search algorithm. (10 points) IV. Give the preorder, inorder, postorder, and level-order traversals of the following binary trees ( 50 points)