$(6$ pts$)$ Graph traversal. Consider breadth$-$first and depth$-$first search starting from the vertex $0.$

a$.$ Write the sequence of vertices in breadth$-$first search order.

b$.$ Write the sequence of vertices in depth$-$first search order.

Notes:

Within each vertex, the edges are iterated over in the increasing order of adjacent

numbers.

The vertex is printed when it is popped from the stack $($or removed from the queue$).$