In a tree between every pair of vertices there is:

Select one:

a$.$ Two paths

b$.$ A loop

c$.($n$)$ number of paths

d$.$ Exactly one path

e$.$ NOTA