Assignment task: Please complete the following questions, they are tightly connected.
Problem 1: What is the adjacency matrix for the directed graph whose Python adjacency list representation is shown below?
{0: [2,3,4], 1: [0, 2], 2: [0, 3], 3: [ ], 4: [1] }
Problem 2: Draw a depth-first search tree and a breadth-first search tree for the graph from question 1, with the starting vertex s=0. In each case, whenever the algorithm loops over the neighbors of a vertex, use the ordering given by the adjacency list from question 1.
Problem 3: Compute the DFS numbers, escape numbers, and strongly connected components of the graph from question 1, with the same assumptions about starting vertex and search ordering as in question 3.