$2.$ Parts $($a$)-($e$)$ refer to the graph $\backslash ($ G$\_\{2\}\backslash )$ :

When asked to give an example of something, if you think no example exists, explain why not.

$($a$)$ Give an example of a walk from $0$ to $5$ that is not a trail.

$($b$)$ Give an example of a trail from $0$ to $5$ that is not a walk.

$($c$)$ Give an example of a trail from $0$ to $5$ that is not a path.

$($d$)$ Does $\backslash ($ G$\_\{2\}\backslash )$ contain any cycles? If so$,$ give an example of one.

$($e$)\backslash ($ G$\_\{2\}\backslash )$ is a connected graph. If you wanted to turn $\backslash ($ G$\_\{2\}\backslash )$ into a non$-$connected graph by removing edges, how many would you need to remove? Which edges would you remove?

Note: There are many possible answers to this question. If you say you only need $3$ edges, then your answer should consist of just $3$ edges. If you say you only need $1$ edge, your answer should consist of just $1$ edge.