An undirected graph $G$ is shown in the figure below.

Assume that the adjacency lists are in alphabetical order. Apply breadth$-$first search $($BFS$)$ on

graph $G,$ starting from vertex $A.$

Answer the following questions $($after BFS is completed$).$

$($a$)$ What is the value of C$.$d$?$

$($b$)$ What is the value of $J.d?$

$($c$)$ What is the value of $C.?$

$($d$)$ What is the value of J$.?$