(i) There are three two-way roads between A and B.
(ii) There are two one-way roads connecting B to C.
(iii) There are four two-way roads between B and D.
(iv) There is only a one-way road connecting B to E.
(v) C and D are connected by a two-way road and similarly D and E are connected by one two-way road.
What is the maximum number of possible ways for a person to go from D to A without touching E?