3- Consider the following Node-Node Adjacency Matrix where it has 7 nodes N = {0, 1, ..., 6}. First draw the graph and then apply the following algorithms on the graph starting from node 0: a) Breadth First Search, b) Depth First Search, c) Topological ordering Note that if you have multiple admissible arcs emanating from a node, use the one with the minimum index for the head node. At the end show the resulting graph for each algorithm which should include the orders of marking the nodes. 2 0 00 1 0 2 0 30 4 0 50 60 1 1 0 1 0 0 0 0 0 0 0 00 0 3 0 1 0 0 0 0 0 4 0 0 1 1 0 0 0 5 0 0 0 1 0 1 6 0 0 0