Based on the above graph, answer the following.

$($a$)$ Represent the graph using a suitable graph representation technique to determine the connectivity between two vertices in constant time.

$($b$)$ Determine whether there is any cycle in the graph applying a suitable graph traversal algorithm.

$[3]$

$($c$)$ List down all possible paths from A to H $.$

$2$