This needs to be written in C. Please follow correct parameters given below.

1. (10 pts) Implement a function that determines if there exist a route between two nodes in an undirected graph. The graph will be represented with its adjacency matrix which for this problem is a binary 2D matrix. For instance, the graph shown in Fig. 1 has the following adjacency matrix: 1 1 0 0 1 0 1 0 1 0 1 0 0 1 0 1 0 0 0 0 1 0 1 1 1 1 0 1 0 0 0 0 0 1 0 0 where Gl614| = 1 means that we can reach node 4 from node 6, and Gl611| = 0 mleans that we cannot reach node 1 from node 6. Your function will return TRUE if there is a path from node 6 to node 1, which in this case there is at least one: 6- 4 - 5 - 1, and return FALSE otherwise. Your function must have the following signature int IsThereAPath (const int** adjacency_matrix, const int num_nodes, const int source, const int destination); 1. (10 pts) Implement a function that determines if there exist a route between two nodes in an undirected graph. The graph will be represented with its adjacency matrix which for this problem is a binary 2D matrix. For instance, the graph shown in Fig. 1 has the following adjacency matrix: 1 1 0 0 1 0 1 0 1 0 1 0 0 1 0 1 0 0 0 0 1 0 1 1 1 1 0 1 0 0 0 0 0 1 0 0 where Gl614| = 1 means that we can reach node 4 from node 6, and Gl611| = 0 mleans that we cannot reach node 1 from node 6. Your function will return TRUE if there is a path from node 6 to node 1, which in this case there is at least one: 6- 4 - 5 - 1, and return FALSE otherwise. Your function must have the following signature int IsThereAPath (const int** adjacency_matrix, const int num_nodes, const int source, const int destination)