Part 2: Analyze the time complexity of the following recursive algorithms. Let T( n ) be the function that calculates the time complexity of an algorithm, where n is either the value or the size of the input. You are required to represent T(n) as a recurrence equation. You are NOT required to solve this equation. Q1. what's T(n) of the following recursive algorithm? int pow 5( int n ) if ( n=2]) return 5; if (n> 1) return (5 *pow 5(n-1)