Please solve this in C++

MATH 115, PROGRAMMING PROJECT: EMAIL PROJECTS TO SONNYZADEHGMAIL.COM The Fibonnaci sequence is a recursive sequence defined as: So the first few terms are 1,1,2,3,5, 8, 13, 21,34,55,.. Write a function/procedure/algorithm that computes the sum of all even-valued Fibonnaci terms less than or equal to some positive integer k. For example the sum of all even-valued Fibonnaci terms less than or equal to 40 is 2 + 8 + 34 = 44. Note that I am NOT asking about Fibonacci terms with even index, e.g. F2, Fa, Fo, etc. but rather Fibonnaci terms whose VALUE is even. Please email me a program that I can compile and run, that solves the above problem given an input k as well as three test cases for three different input values. For example if you function is called even fibonnacisum(k) then email me the even fibonnacisun(k) file as well as three test cases such as even fibonnacisum(40), even fibonnacisum(400), evenfibonnacisum(4000)