Walks, Paths and Connectivity · Medium problem

In a graph with edges $12,23,34,42,25$, the walk $1\to2\to3\to4\to2\to5$ revisits vertex $2$. What is the length of the shortest walk from $1$ to $5$ obtained by deleting the detour between the two visits to $2$?