For the directed multigraphs in Exercises $17$ and $18,$ perform the following tasks:

$($a$)$ List the simple directed paths from A to B$.$ Give the length of each.

$($b$)$ List the distinct directed cycles. $($Two directed cycles are distinct if there is a directed edge in one, but not in

the other.$)$ Give the length of each.