Walks, Paths and Connectivity · Challenge problem

Let $G$ consist of two copies of $K_4$ sharing no vertex, one on $\{1,2,3,4\}$ and one on $\{5,6,7,8\}$, joined by the single bridge $48$. Find the maximum number of pairwise internally-disjoint paths between vertices $1$ and $2$.