Write a C++ program that checks if a number is Palindrome (use recursive function as you code). A palindrome number is a number that reads the same from beginning to end and from end to beginning, in other words, a palindrome number remains the same when its digits are reversed. For example, 13431 is a palindrome number. 2332 is another one. (Note: Your program should receive an integer number as the input and always work with integer types, i.e., you cannot use string or char types throughout your code. You cannot convert the input to a string.)

Answer in C++ only Reverse Polish Notation (RPN) is a mathematical notation where every operator follows all of its operands. For instance, to add three and four, one would write "3 4 +" rather than "3 + 4". If there are multiple operations, the operator is given immediately after its second operand; so the expression written "3 - 4+ 5" would be written "3 4 - 5 +" first subtract 4 from 3, then add 5 to that. Transform the algebraic expression with brackets into RPN form. You can assume that for the test cases below only single letters will be used, brackets [] will not be used and each expression has only one RPN form (no expressions like a*b*c) Input 1 (a+(b*c)) Output abc*+

Write a C++ recursive function int fib(int n) that returns the value of the n’th Fibonaccinumber . Do not use a loop. Test it in the main program, not in the function.The Fibonacci sequence is0 1 1 2 3 5 8 13 21…Each Fibonacci number is the sum of the preceding two Fibonacci numbers.

Write a program that reads a set of floating-point numbers and prints out the ten largest numbers. As you process the inputs, do not store more than eleven numbers. When it holds more than ten values, remove the smallest value, as it cannot be a part of the answer. Program language c++