Question 6 Let G be the weighted graph (a) Show that Dijkstra's algorithm correctly nds that the shortest path from A to B is the direct path using

Please provide explanation and working out. Thanks in advance.

Question 6 Let G be the weighted graph (a) Show that Dijkstra’s algorithm correctly ﬁnds that the shortest path from A to B isthe direct path using just the edge AB. You can do all the work on a single diagram,but, to show that you have used the algorithm correctly, if an annotation needs updating do not erase it — just put a line through it and write the new annotationabove that. (b) In what order are the vertices added to the tree? (c) Notice that the algorithm does not, in this instance, generate a sparming tree. Whichvertex or verticas are missing? (d) Extend the use of the algorithm until the shortest distance from A to each othervertex is established, and a spanning tree is thereby generated. Draw this tree. (e) Is the spanning tree you have generated using Dijkstra’s algorithm a minimal spanningtree? Justify your answer.