From the directed graph above, and assuming that vertex '0' is the starting point, list the order of processing the vertices: a) Using the depth-first traversal method: and indicate which data structure is the most appropriate to implement it. b) Using the breadth-first traversal method: and indicate which data structure is the most appropriate to implement it