I need 3 and 4

CISP 430 Assignment 12 Spring 2018 For each of the graphs shown, show hand executions for each of the following algorithms: 5/ 12 3 (G Graph 1 Graph 2 DO THESE ONES: 1) Determine the minimum spanning tree for node A using Prim's algorithm ) Determine the routing table for node A using Dijkstra's (oSPF) algorithm. 3) Determine the "global" routing table using Distance Vector (RIP) algorithm. 4) EXTRA CREDIT 10pts: IMPLEMENT RIP-print the first few and the last few "global" routing tables. RESOURCES: See the posted "class lecture notes" for the algorithms, and the posted file "GraphExamples.pa" for some execution examples. Turn in: Lots of paper with computer-drawn diagrams. Show all your work, including: 1) 2) 3) Redraw the trees as they are built node by node. Show the corresponding array values as they are updated. Make your execution clear and easy to follow