B2 Consider the following graph G. ei: 4 22:5 es: 7 ez: 3 e4: 8 e7: 5 V W e6: 6 es: 3 u es: 7 S eio: 6 (a) Find the total degree of G. [2 marks] (b) Find the total length of all edges of G. [2 marks] Write down the incidence matrix of G. [4 marks] (d) Find a minimum spanning tree of G and state its weight. [6 marks] (e) Apply the Dijkstra's shortest path algorithm to G to find the shortest path and the shortest distance from p to s. Show your working step by step clearly when applying the algorithm. [6 marks]