QUESTION 5) Consider the following Adjacency Matrix for a Directed Graph with edge costs. a) Draw the Directed Graph. b) Draw the Adjacency Linked Lists. c) Write the following C function: void fonk(int * matris[], int N); Function takes the adjacency matrix and the size as input parameters. Function should find and display the name of the node which has the lowest number of outgoing connections. A E F A 1 7 8 D 4 4 9. F 8 2 01 | 0| 0|0 B Oo mooO