The Lucas Numbers are a sequence very similar to the FibonacciSequence, the only difference being that the Lucas Numbers startwith L0 = 2 and L1 = 1 as opposed to Fibonacci’s F0 = 0 and F1 = 1.Concretely, they are defined by L0 = 2, L1 = 1, and Ln := Ln−1 +Ln−2 for n > 1. Write a function in C++ that takes an integerargument N and returns the sum of the first N + 1 even LucasNumbers.
