4 8 8 Question 1: A leading national telecommunications firm wants to build a cable network between Pakistan's different major cities (Assuming cities named A to B). Instead of directly connecting all the towns, the cable can be connected from a current city to the next. (Extension can be achieved, for example, to connect Lahore to Multan from either Sahiwal or Faisalabad.) The nodes that need to be connected are shown in the table along with their cost of setup. It is assumed that you can set up the network at the least possible expense. Notes Path Cost A TOB A TOH B TOC B TOH CTOD 7 C TOI C TOF D TO E DTOF E TOF FTOG 2 G TO 1 A. Construct an undirected graph from the given table. B. Apply the shortest path first algorithm and show the shortest path. 11 2 4 9 14 10