#$3$: Can you use the DFS algorithm to compute the number of distinct paths between two given vertices s and t$?$ Two paths between s and t are considered distinct if they differ by $1$ or more edges. If you think the answer is yes, then provide the pseudo$-$code for a DFS based algorithm that computes this number in O$(|$V$|+|$E$|).$ If you think the answer is no$,$ draw a graph with at$-$least eight vertices in total, with two of its vertices labeled s and t$,$ in which DFS will fail to compute the number of distinct paths between s and t$.$