the third question please.

. In Chapter 7, we leaned about the routing The entry in row 1, column 4 is 4 because the length of the line between node 1 and node 4 is 4. The entry in row 0, column 3 is oo because there is no direct line between nodes 0 and 3. All the entries on the "main diagonal (positions [0,01 1,11 [2,21 [3,31, and [4,4D are 0 because there is a of finding the optimal path from a source node to a destination node. Each hop along a path represents a communication channel between two nodes that has an associated "cost"; the cost might actually be a monetary cost to use a leased line, but it could also be a cost in terms of the volume of traffic the line typically carries. In either case, the shortest path" is the one with the lowest cost. As mentioned in Chapter 7, the Internet uses Dijkstra's shortest path algorithm to solve this problem. If node x is the source node and receives a message for node y, then x only needs to know the shortest path from iself to node y. But an alternative is to have a centralized site periodically compute the all-pairs shortest path " from any node to any other 0-length link from a node to itself Floyd's algorithm operates on the array A nodes in the network. The algorithm for the all-pairs shortest path, called Floyd's algorithm, is simpler to A two-dimensional array (table) is used to nodes in the network, the array is n X nin size. The entry in position i, j of the array is the length (cost) of the line from i to j. For example, the following position [i,] of the array represents the length of this algorithm does not say what the intermediate 2 Write a program in the language of your choice to solve the all-pairs shortest path problem for a graph with five nodes. The program gets the values for each row of the array from the user, runs Floyd's algorithm, and writes out the resulting array. Use 500 for"infinity," which assumes all legitimate line 3 Try your program for the graph shown here From the output of your program, what is the length of the shortest path from node 2 to node 4? By looking at the graph, what are the nodes on this It is represented by the 5 x 5 array shown here 4. Exercise 1 asks you to write a program to searcha list of integers for a particular value. Your program asks the user to enter the list at the keyboard, the same mechanism we have used for collecting data