Bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb
Edit your profile, click preferences, and then there should be a drop down that has your level on it which you can change.
The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.
int recursiveOddSum(int n) {
if(2n-1==1) return 1;
return (2n-1) + recursiveOddSum(n-1);
}
To prove the correctness of this algorithm by induction, we start from the base case as usual:
by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).
Now we can assume that 
returns indeed the sum of the first n-1 odd numbers, and we have to proof that 
returns the sum of the first n odd numbers. By the recursive logic, we have
and by induction, is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, is the sum of the first n odd numbers, as required:
An open-source physical computing platform that can take input from a variety of switches or sensors to control physical objects is known as Arduino.
Arduino means an electronics prototyping system is built to simplify microcontroller projects. The concept is to product these projects without having to know much about microcontrollers or programming, microcontrollers for dummies is one tips of explaining Arduino. Arduino has function to control of traffic lights, it can also be used for the real time control system with programmable timings, pedestrian lighting etc. Arduino can respond with buttons, LEDs, motors, speakers, GPS units, cameras, the internet, and even your smart-phone or your TV.
Learn more about Arduino at brainly.com/question/13098809
#SPJ4
D is the answer to that problem
