Fibonacci series and prime factorisation Description We have to do this without using recurrenceusing only for,if,while, do loop Problem 1: EVEN FIBONACCISIn mathematics the sequence Fn of Fibonacci numbers is defined by the recurrence relation: Fn = Fn-1 + Fn- where F = and F1 = 1In other words, every Fibonacci number is the sum of the previous two Fibonacci numbers with the first two Fibonacci numbers defined as and 1. Here are the first 1 numbers of the Fibonacci sequence., 1, 1, , 3, 5, 8, 13, 1, 3In this problem, given an input integer X (from the user) you have to output the sum of all even Fibonacci numbers below X.For example, if X = 35 then the sum of all even Fibonacci numbers below X is .If X = 3 then the sum of all even Fibonacci numbers below X is 1. Sample input and outputs follow.Sample Input and Output 1Enter max limit1The sum of all even fibonaccis before 1 is: Sample Input and Output Enter max limit3The sum of all even fibonaccis before 3 is: 1 Problem : PRIME FACTORSIn this problem, given an input integer X (from the user) you have to output all of its prime factors as well as the minimum and maximum prime factors separately. Sample input and outputs follow.Sample Input and Output 1Enter an Integer:78Prime Factorization: x 3 x 13 Minimum: , Maximum: 13Sample Input and Output Enter an Integer:6Prime Factorization: x x 3 x 5 x 7 x 11 Minimum: , Maximum: 11Prime factorization of an integer is breaking the integer down into a set of prime numbers which multiply together to result in the original integer.For example, the prime factorization of is x x 7. The prime factorization of 31 is 3 x 17. Header Button Label: View Our Writing SamplesView Our Writing SamplesDo you need help with an essay or assignment writing?Let our professionals writers assist you with research and writing. Header Button Label: Place Order NowGet Started Now

Write My Essay Online

"Are you looking for this answer? We can Help click Order Now"