$11.$For the given graph below, use the depth$-$first search algorithm to visit the vertices and write the sequence of the visit. Start from the vertex $"$A$".$ At any given vertex, you will visit first the unexplored vertex that has least alphabetical order.

Answer the sequence of visiting the vertices: $-$

$12.$ For the given graph below, use the Breadth First Search $($BSF$)$ algorithm to visit the vertices and write the sequence of the visit. Start from the vertex $"$R$".$ At any given vertex, you will visit first the unexplored vertex that has least alphabetical order.

Answer the sequence of visiting the vertices: $-$