Can you find a path from a number at the top of this network to the bottom which goes through each of the numbers $1$ to $9$ once and once only?