Five towns A, B, C, D and E are connected as shown below. The times of travel are the back and forth the weights indicated on the connections using the arrows. B 4 E 5 3 8 D 7 8 Figure 1: connections between the towns 1. Using tables represent the information in figure 1 above. 5 marks. 2. Using matrices represent the information in figure 1 above. 5 marks. 3. Using arrays represent the information in figure 1 above in C++ language format. 5 marks. 4. If the distance of travel is in Kilometers (Km) and the cost of fuel is GHC 2 per Km, write a function named Consumption (distance) to calculate the fuel consumed if the distance is passed onto the function.. 5 marks. 5. In moving from town A to E, what will the value of the shortest path be and which towns will you route through? 5 marks. 6. Assuming, you are in charge of the IT Department of a postal service and you are suppose to optimize the routes of travel for the transport. What will the overall total cost of the transport department be, if they will have to visit all towns A to D and return back to A without visiting E by exactly visiting a town once? Show all possible routes to the towns visited from A to D 3 marks. Indicate the shortest route. 2marks