Sum the Numbers Write a flowgorithm program, using nested loops, that performs the following tasks: • The outside loop asks if the user is going to enter numbers to sum • The inside loop should: o ask for input of a positive or negative number o input of zero (0) will terminate the input loop and display the sum of the input numbers The outside loop, will ask if a new set of numbers will be will input or should the program stop. • If a different set of numbers is input a new sum should be calculated and displayed. • The program continues to run until stopped via the outside loop. Remember the following: use clear prompts for your input • label each output number or name use comment box for your name, lab name and date at the top of the flowgorithm use other comments where appropriate use appropriate constants

The following recursive function takes three positive integer arguments:  def compute(n,x,y) :     if n==0 : return x     return compute(n-1,x+y,y)   What is the value returned by the compute function? n*x+y x+y x+n*y x What if: will the returned value be for the compute function defined in the question above if the argument n is negative? x x-n*y x+n*y The function will never return a value.

int p =5 , q =6;  void foo ( int b , int c ) {  b = 2 * c ;  p = p + c ;  c = 1 + p ;  q = q * 2;  print ( b + c );  }  main () {  foo (p , q );  print p , q ;  } Explain and print the output of the above code when the parameters to the foo function are passed by value. Explain and print the output of the above code when the parameters to the foo function are passed by reference. Explain and print the output of the above code when the parameters to the foo function are passed by value result. Explain and print the output of the above code when the parameters to the foo function are passed by name.

Ex. 01 : Recursion About So far, we have learned that we can perform repetitive tasks using loops. However, another way is by creating methods that call themselves. This programming technique is called recursion and, a method that calls itself within it's own body is called a recursive method. One use of recursion is to perform repetitive tasks instead of using loops, since some problems seem to be solved more naturally with recursion than with loops. To solve a problem using recursion, it is broken down into sub-problems. Each sub-problem is similar to the original problem, but smaller in size. You can apply the same approach to each sub-problem to solve it recursively. All recursive methods use conditional tests to either 1. stop or 2. continue the recursion. Each recursive method has the following characteristics: 1. end/terminating case: One or more end cases to stop the recursion. 2. recursive case: reduces the problem in to smaller sub-problems, until it reaches (becomes) the end…