$1)$ Breadth$-$first search starting at A would mark A as depth $0.$ Any adjacent vertices will be marked with depth $1.$ The next wave would have depth $2,$ then $3,$ and so on$.$ Redraw the graph above and mark each vertex with the depth from breadth$-$first search starting at A$.$

$2)$ What is the greatest possible depth of a vertex in the above graph if you are able to start the breadth$-$first search from any point on the graph?