Walks, Paths and Connectivity · Easy problem

A graph on vertices $1,\ldots,5$ has edges $12,23,34,45,13$ (a path $1\text{-}2\text{-}3\text{-}4\text{-}5$ with one extra edge $13$). How many walks of length $2$ are there from vertex $1$ to vertex $4$?