Question 21A spider at vertex $A$ of the cube wants to reach a bug at vertex $G$ by the shortest route along the edges. How many shortest routes are there?