Question 3: Find the Minimum Spanning Tree for the given graph using Prim's algorithm and write the steps. A 2 11 U TI 8 7 1 2 O 6 B 7 4 2 5 H 9 10

Use Dijkstra's algorithm to construct a shortest path tree starting from vertex_ that includes all vertices in the original graph. Use the format shown in the given table. After filling in the table, draw the resulting shortest path tree in the empty box. 2 6 b fringe list 2 a STEP vertices in tree next edge to add 9 9 1 d с 4 12 2 2 2 f 9 1 h 3 4 5 6 7 8

Every data structure that we use in computer science has its weaknesses and strengthsHaving a full understanding of each will help make us better programmers!For this experiment, let's work with STL vectors and STL dequesFull requirements descriptions are found in the source code file Part 1Work with inserting elements at the front of a vector and a deque (30%) Part 2Work with inserting elements at the back of a vector and a deque (30%) Part 3Work with inserting elements in the middle, and removing elements from, a vector and a deque (40%) Please make sure to put your code specifically where it is asked for, and no where elseDo not modify any of the code you already see in the template file This C++ source code file is required to complete this problem

Q.1 Use the breadth-first search algorithm to find a spanning tree for the connected graph (Start vertex is A): (a) F H F R D