Answer:
3- The code takes in an input, turns it into an integer and then multiplies it by 2 and prints it
Explanation:
Look- First, the code snippet asks for an input (int or float) as "Rawheight".
Aftewards, it converts the input into an integer numeral(if it was a float) and multiplies it by 2.
This processed value is, then, further transferred to the variable "double_height" and is thereafter rendered on the user's virtual screen.
a.The primary purpose of JavaScript is to enable features such as validation of forms before they are submitted to the server.
<u>Explanation:</u>
On web pages before submitting the day, end user has to do client validations such as whether data enter is correct data type, so end user for client side validation been eiher by VBSCRIPT (visual basic script language) or (JavaScript java script). Internet explorer or Microsoft edge uses VBSCRIPT for web page validation.
For visual basic script languages end user should have enough knowledge on visual basic programming languages. Same away for java script end user have enough knowledge on c language.
Both Scripts are used for client side validation on success of validation end user will submit web page form for next action. JavaScript is used in most of the browser including Microsoft explorer or Microsoft edge.
To post a picture you just need to click on the clipper looking thing
Answer: Switch
Explanation: ARP spoofing is a illegal harmful activity in a disguised manner by a person who tries to send the ARP (Address resolution protocol)request.The disguised ARP request is sent to steal the confidential data by the overloading of the switch because of the numerous amount of the ARP request. This attack is done in the local area network .Therefore, the correct option is switch.
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:
