By considering the following directed graph: a. Define this graph G = (V, E) by the finite set V = {v1, v2,. . . , Vn} whose elements are called vertices, and by the finite set E = {e1, e2,. . . , Em} whose elements are called arcs/edges.(10 marks) b. Define each arc/edge: e = (x, y) (10 marks) c. Determine the degree of each vertex and the degree of the graph (10 marks) d. Build the predecessors table (10 marks) e. Build the adjacency matrix of this graph (10 marks)

2 7 4 3 5