In Figure $1,$ a map is given. The map's grid reterence is made up of rectangular cells. The edges of a cell form the paths through which you can move. You are supposed to navigate from the starting point marked with $S$ to the destination point marked with $D.$ The only permissible moves are to move to the right or up$.$ Any other move is illegal. A move is counted as $1$ if you change from moving right to moving up or from moving up to moving right, irrespective of the number of cell edges you cover or when moving straight to $D.$

i$.$ Find the total possible routes from $S$ to $D.$

$8$

ii$.$ Explain how you got your answer in item $($i$).$

$2$

$\backslash$table$[[,,,,,,,],[,,,,,,,],[,,,,,,,],[,,,,,,,],[,,,,,,,],[,,,,,,,],[$s$,,,,,,,]]$

Figure $1$: Finding the way from start $(S)$ to destination $($D$)$