with clear explenation please to get ready for the finel i dont have alot of time

1. (B) jainho) Erehoutaidy Binetio ill fi. 13is formi tom in then an DH ele Bentiar of ele altiontis. Given a list of integers X=[a0,a1,,aN1] you are asked to write the pseudo-code of an algorithm that finds the total count of entries ai that satisfy ai+1ai=ifor(i0) Note: The first entry has index 0. Example: For X=[1,1,1,3,5,9,3] the output will be 3 (the bold entries satisfy the equation) (a) (10 points) Design an iterative solution to the problem (i.e. using a for or while loop). (b) (10 points) Design a recursive solution to the problem. What is the base (i.e. stopping) case of your recursive function? (c) (10 points) Explain what "Divide and Conquer Strategy" is and how it can be used in the solution of this