# Complete the if_sum_n_distinct_fib function below. def if_sum_n_distinct_fib(x, n):

Sum of unique fibonacci numbers Given positive integers x and n, determine if x can be expressed as a sum of n unique fibonacci numbers. Fibonacci numbers are from a series 1, 1, 2, 3, 5, 8, 13, 21, .. in which starting from the third number, each number is the sum of the previous two numbers. Input Format Output Format Arguments: A booean value indicating x: int, target whether this can be achieved. sum n: the number of integers x-10 Sample Input Sample Output x-6,n-2 |True x-5,n 3 False True 10059560, Sum of unique fibonacci numbers Given positive integers x and n, determine if x can be expressed as a sum of n unique fibonacci numbers. Fibonacci numbers are from a series 1, 1, 2, 3, 5, 8, 13, 21, .. in which starting from the third number, each number is the sum of the previous two numbers. Input Format Output Format Arguments: A booean value indicating x: int, target whether this can be achieved. sum n: the number of integers x-10 Sample Input Sample Output x-6,n-2 |True x-5,n 3 False True 10059560,