Walks, Paths and Connectivity · Medium problem

A triangle on vertices $1,2,3$ has a pendant vertex $4$ attached only to $1$, and a pendant vertex $5$ attached only to $2$ (edges $12,23,31,14,25$). What is the length of the longest path (no repeated vertex) from vertex $4$ to vertex $5$?