Question 1 Input a weighted you may assume all weights are positive) undirected graph and display the shortest path's cost and path to all other nodes starting from any arbitrary node. Sample Graph 6 B 5 N 1 2 2 5 D E 1 Sample Output Starting Node is A) Destination Node Shortest Cost Shortest Path 0 B 3 ADB c 7 A,D,E,C D 1 AD E 2. A.DE Question 2 a) You have been asked to find shortest path from a particular source to another particular destination by must visiting another particular node. Display shortest cost following the above- mentioned constraint b) You have been asked to find shortest path from a particular source to another particular destination by must avoiding a particular node. Display shortest cost following the above- mentioned constraint