write a program supported on linux servers to implement the OSPF link-state (LS) algorithm for a given set of nodes identified by a lower-case letter (a–z).

In the program, you will prompt for the number of routers and then read in a file containing values for an n x n cost matrix, where n is the number of routers entered by the user, such as the one given above. Optionally, you may ask the user to enter the character representation of the first node, such as u in the example given above so that your node representation is schematically correct. Finally you will prompt the user to enter the source router from which to calculate the shortest path cost and path taken from the source node to each node in the graph in the correct order. Your code should handle all errors appropriately, such as printing an error message and/or terminating the program if the file for the cost matrix does not exist