Please help

Implement the Hanoi Towers Algorithm. public static void solveTowers(int count, char source, char destination, char spare) {if (count == 1) {System.out.println("Move top disk from pole " + source + " to pole " + destination);} else {solveTowers(count-l, source, spare, destination); solveTowers(l, source, destination, spare); solveTowers(count-l, spare, destination, source);}} Q-2: Find the recurrence equation T(n) and solve it