Question $1(1\mathrm{.}5$ pts$)$

Social networking sites like Facebook and LinkedIn use graphs to represent connections among people. For a particular user, a site may wish to recommend new connections. One approach does a breadth$-$first search starting from the user, recommending new connections starting at distance $2($distance $1$ people are already connected with the user$).$

BFS: Connection recommendation.

Refer to the connection recommendation example above. True$/$False$?$

$1)$ A distance greater than $0$ indicates people are not connected with the user.

$2)$ People with a distance of $2$ are recommended before people with a distance of $3.$

$3)$ If Chen is the user, the system also recommends Eva, Jun, and Ken.

Question $2(1$ pt$)$

Perform a depth$-$first search of the graph below. Assume the starting vertex is E$.$