Design a function that solves the Towers of Hanoi game for the following directed graph g=(v,e) with v={start,a1,a2,a3,dest) and e={(start,a1),(a1, a2),(a2,a3),(a3,start), (a3,dest)}?