Walks, Paths and Connectivity · Superchallenge problem

Let $G$ be three copies of $K_4$ in a chain: $K_4$ on $\{0,1,2,3\}$, then bridge $34$, $K_4$ on $\{4,5,6,7\}$, then bridge $78$, $K_4$ on $\{8,9,10,11\}$. Find the maximum number of pairwise internally-disjoint paths between $0$ and $10$ (in different end blocks), PLUS the maximum number between $0$ and $2$ (both in the first block).