PS #3 Lecture 3 Handed Out: Due: 16/02/2021 22/02/2021 This assignment is particularly designed to reinforce what was learnt in class and help them focus energy on areas that matter most. Goal: Student is expected to apply graph representation and the greedy algorithms (Prim's and Kruskals algorithm) to solve a shortest path problem. TODO 1. Answer all questions a. Represent the below graph as adjacency matrix. B D 2 F c E b. Go to the following link and copy the python code to your python IDE: on mst.greedy-algo-5/