Three small towns, designated $A,B,C$ are interconnected by a system of two-way roads as shown in the following picture:
Image of interconnected cities
How many ways are there to go from $A$ to $C$ and come back from $C$ to $A$ such that the connections which are used to go from $A$ to $C$ cannot be used again. For example, if you use ($R_1$ and $R_6$), then they are cancelled for going from $C$ to $A$, you may use the roads ($R_5$ and $R_2$) or use ($R_8)$.
Second example, if you use $R_9$ go from $A$ to $C$, then it will be cancelled, so you can use ($R_8$) or ($R_7$ and $R_1$) or ($R_5$ and $R_3$) etc for going from $C$ to $A$.
My solution: There are $4\cdot3+2=14$ ways to go from $A$ to $C$, I tought that there may be $3\cdot2+1=7$ to come back. However, I am not sure. So, I want help for it..
NOTE: Unnecessary travelling is not allowed, i.e, you should always move to your target, for example if you go from A to B then you cannot shuttle here, you should move from B to C.