A palindrome is a string that reads the same forward and backward. An integer is called prime-palindromic if it is possible to construct a palindrome by concatenating all of its prime factors (without leading zeros). Each prime factor should be used as many times as its power in factorization. 48 is prime-palindromic because its prime factors are 2, 2, 2, 2, 3 (2 should be used 4 times, 3 should be used once) and we can obtain the palindrome 22322. 2261 is prime-palindromic also because its prime factors are 7, 17, and 19, which can be concatenated to form the palindrome 71917 33 is also not prime-palindromic (its prime factors are 3 and 11). Write a program which takes a number from user and then calls a function to extract the prime factors in an array(declare an array of max size 100 and then initialize them to some dummy value).Now write a recursive function to form all possible permutations from these factors and then if any of these permutations is a palindrome then your original number is prime palindromic. ((write recursive function to check palindromes and get permutations)