Answer the following questions for this graph.

digraph $2-1.$png

List the nodes that will be reachable from node $3.$

Give the the length of the shortest path from node $2$ to node $6.$

What is a path from node $1$ to node $6$ of length $4?$

Is there a path from node $5$ to node $2($yes or no$)$