The figure shows four towns A, B, C and D and the roads joining them: 3 roads join A and B, 2 roads join B and C, 2 roads join A and C, 3 roads join C and D, and 1 road joins B and D. No road passes through any other town.

(i) In how many ways can Rina travel from A to D if she does not visit any town twice?
(ii) One day Rina goes from A to D through B only (A → B → D) and then returns from D to A. On the way back she visits no town twice and does not use any road she used on the way out. In how many ways can she make the whole round trip?
