Given a number N, the task is to find if N is Fibonacci-prime number or not. A Fibonacci-prime is any number that is both a prime and a Fibonacci number.
Input: N = "5"
Explanation: 5 is a Fibonacci number and
Input: N = "8"
Explanation: 8 is a Fibonacci number but,
not a prime.
You don't need to read input or print anything. Your task is to complete the function fibonacciPrime() which takes a string as inputs representing the number and returns 1 if the given number is a fibonacci-prime number, otherwise 0.
Expected Time Complexity: O(constant).
Expected Auxiliary Space: O(constant).
1 <= |N| <= 75