For the following algorithms given in pseudocode, describe what each algorithm does.

This issue compares the execution times of the two multiplication algorithms listed below:KindergartenAdd algorithm (a, b)A and B are integers, pre-cond.post-con: Produces a and b.

Design an algorithm using pseudocode that inputs three numbers. The algorithm must determine and then display the middle value – that is the number which is neither the smallest nor the largest. Check to see that your algorithm works for numbers where one or more of the values is repeated. Be certain your algorithm works for negative values. Determine if it is possible to extend the algorithm to finding the middle value of five numbers. Try to build an algorithm that does not just exhaustively test for all possibilities. That is the “brute force” algorithm and better solutions can be created.

Express the Euclidean Algorithm in pseudo-code, then convert your pseudocode to a Python Program. "The Euclidean algorithm finds the greatest common divisor of two positive integers X and Y by the following process:  As long as the value of neither X nor Y is zero, assign the larger the remainder of dividing the larger by the smaller.  The greatest common divisor, if it exists, will be the remaining non-zero value."

Please use python language. Write a recursive program to find the sum of first n numbers. sum = 1 +2 + 3 + …….n

What is the step count of the pseudocode below:   for i=0 to 8 do    for j = 0 to n do       s = s+ i * j    endfor endfor