8. do[ num = num + 1 ; if (num * 2 〉 MAX + num) System.out.print (num + ""); while (num <- MAX) 9. for (int value0 value >- 7; value++) System.out.print (value " "); 10. f r (int value = 7: value < 0; value-_) System. out.print (value + " w); 11. for (int value - 1; value -20; value+-4) System.out.print (value + " W); 12. for (int value -num; valueMAX; value++ System.out.print (value " "); 13. for (int value - num; valueMAX; value++) System.out.print (value " "); 14. for (int value-MIN; value 〈-MAX ; value++) System.out.print (value " "); if (value%4 ! 0) 15. f r (int value = MAX ; value 〉= MIN; value-= 3) System. out.print (value + " w);

When calling a function that takes many arguments, it is necessary to determine whether or not the order in which parameters are supplied makes a difference.

Module/Week 2 ASSIGNMENT (INPUT/OUTPUT)The number of permutations of a set of n items taken r at a time is given by the following formulan !⁄r !(n-r)!: where n! is the factorial of n, r! is the factorial of r, and (n-r)! is the factorial of the result of n-r. The factorial of a number n can be solved using the following formula: 〖n!=e〗^(-n) n^n√2πn. If there are 18 people in your class and you want to divide the class into programming teams of 3 members, you can compute the number of different teams that can be arranged using this formula (n !⁄r !(n-r)!). Write a C++ program that determines the number of potential team arrangements. You will need to use the double type for this computation. Use the Lab Template you set-up last week, proper formatting, and appropriate comments in your code. The output must be labeled clearly and formatted neatly. Submit C++ Programming Assignment 2 by 11:59 p.m. (ET) on Monday of Module/Week 2.

Please complete the exercise as instructed and do not use global variables. Please follow the guidelines of what the solution cannot use provided in the second picture. Thank you!