Please help with Data Structure

1. Consider the directed graph that appears in the Figure below: a. In what order will a breadth-first traversal visit the vertices when you begin at vertex A ? b. Repeat Part a, but perform a depth-first traversal instead. 2. Consider the graph below that represents a maze. The uppermost vertex labeled S (the entrance to the maze) and the lowest vertex labeled T (the exit from the maze). a. Is this graph a tree? b. What is the shortest path from S to T ? c. What is the longest simple path in this graph? What to submit: 1. The word documents that includes the solutions