A directed graph G is shown in the figure below.

The graph is stored in computer memory using adjacency lists. We further assume that the adjacency lists are in alphabetical order. In other words, the vertices on the adjacency list of any vertex are in alphabetical order.

Answer the following questions:

$($a$)$ The first node on the adjacency list of vertex B is

$($b$)$ The second node on the adjacency list of vertex B is

$($c$)$ The first node on the adjacency list of vertex H is

$($d$)$ The second node on the adjacency list of vertex H is

$($e$)$ The first node on the adjacency list of vertex J is

$($f$)$ The second node on the adjacency list of vertex J is