Please answer q2&q3

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(1, source, destination, spare); solveTowers(count-l, spare, destination, source);}} Find the recurrence equation T(n) and solve it. Find O(n)