Assume the following table of one-way interactions between two computing nodes in an institution. Start A Destination B Distance (m) 20 D E 40 C D -15 B E 15 D B 10 E A C D -30 5 Table 2. a) Perform a suitable parallel graph algorithm to find all the shortest paths between any two nodes in Table 2. Describe each phase required to complete the algorithm. (12 marks) b) Assume that the interaction between nodes in Table 2. can be presented as a minimum spanning tree. Transform the distances into positive weight and construct the spanning tree using the Kruskal algorithm. Describe each phase required to complete the algorithm. (8 marks)