Write C Program to delete duplicate elements from an аггаy Accept Numbers: 134 53 Array with Unique list: 13 4 5 int pooin 0r

Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - ­1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ).  Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 :  n = 4 / 2  = 2Step 2 : n = 2 / 2  =  1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 :  n = 7 ­- 1 = 6Step 2 : n = 6  / 3 = 2 Step 3 : n = 2 / 2 = 1  SolutionDp///.

The statement 2n< n!  is valid for a.All positive integers b.All positive integers n ≥ 4 c.For only n=4d.All positive integers n ≤ 4