Please help me with the problem for my upcoming Combinatorics test:
A moth starts at vertex A of a certain cube and is trying to get to vertex B, which is
opposite A, in five or fewer “steps,” where a step consists in traveling along an edge
from one vertex to another. The moth will stop as soon as it reaches B. How many
ways can the moth achieve its objective?
Please provide a detailed solution.