Write a PROLOG program to show the path from the root to the given destination. For example,

$?-$ path$($y$).$

a $-->$ c $-->$ h $-->$ o $-->$ v $-->$ y

a$.$ Define a predicate connect$/2$ to list the relation between two characters.

b$.$ Define a rule called path$/1$ to find the path from root to the destination.

c$.$ Define a rule called path$/2$ to find all paths from a node to another node that visit a specified number of nodes.

E$.$g$.,?-$ path$($c$,3)$

c $-->$ a $-->$ b;

c $-->$ a $-->$ d;

c $-->$ g $-->$ n;

c $-->$ h $-->$ o;