Walks, Paths and Connectivity · Medium problem

In the wheel graph (hub $0$, rim $1\text{-}2\text{-}3\text{-}4\text{-}1$), which pair of rim vertices has more walks of length $2$ between them: the adjacent pair $1,2$, or the opposite pair $1,3$? Give the larger of the two counts.