Consider a graph with the given representation using adjacency lists. 0 0 04 0 04 1) -(3 4 4 a) Traversgraph usin h-first search from node List Lis all thdiscowry edges and all s in orde ack edges, dis ing the dges in the direction ey rec ve eir labels. (or e ple, if you v it vx a then y u use edge (a,b) to discove tex b, then (aa discovery ed er than (b,a b) Traverse the graph using breath-first search (BFS) from node 0 List all nodes in order of traversal List all the discovery edges and all the cross edges, displaying the edges in the direction they receive their labels c) Tse the graph usidepth first search (DFS) node 4 st a nodes in Li the of traver al very edges a all the ba edges he edges in e direction their labels