Question 1 a) Design a class that will store a weighted directed graph using adjacency Matrix with following functions. 1- Count the out-degree of all nodes. 2- Count the in-degree of all nodes. 3- Print all neighboring vertices of a particular vertex. 4- Check if two vertices are directly connected if their indices are provided. b) Using the provided grapha.txt file, test your functions and Q2. In grapha.txt file, the first line tells you're the number of nodes in graph. Rest of the lines tell what vertices are connected and with what weight. 1 grapha.txt file will be as follows: 5 121 135 212 251 324 543 512 2 3 5