3. The tower of Hanoi problem is an interesting problem in Computer Science, the algorithm for Tower of Hanoi is given in the lecture notes, which is given here again: 1 TowerOfHanoi(tower1, tower2, tower3, n) if n = 1 print move disk n from toweri to tower2 else TowerOfHanoi(tower1, tower3, tower2, n-1) Print move disk n from toweri to tower2 TowerOfHanoi(tower3, tower2, tower1, n-1) Based on this algorithm, write a C++ program, and call this function from main, by supplying the names of tower1, tower2, tower3, and also passing number of disks (n)