Draw the adjacency matrix representation of the following directed and weighted graph. (C2-PL01) (10 marks) 5 14 30 15 2 25 11 2 17 DO 15 12 10) 8 Use Depth First Search to find a path from node 6 to node 10 in the figure above. How does this compare to the shortest path from noe 6 to node 10? (C4-PLO2) (10 marks) Write a C function to calculate the number of items in a stack. Assume you are given the following functions for working with a stack. Your solution must preserve the items and their order in the stack. (C3-PLO2) (10 marks) void push (struct node ** cop, struct element new_data) ; struct element pop (sumunode top) int is Empty(struct node top)