Walks, Paths and Connectivity · Medium problem

A $2$-by-$3$ grid of vertices $1,2,3$ (top row) and $4,5,6$ (bottom row) has edges $12,23,45,56,14,25,36$. What is the maximum number of pairwise internally-disjoint paths from vertex $1$ to vertex $6$ (opposite corners)?