Procedure non-dominated_sorting (P) input: Population solutions output: Pareto sorting solutions set Step1. //create the Pareto level 1 For each solution ke P Sk; //memory the solutions which are dominated by k nk = = 0 //the number of solutions which dominate k Step 1.1 For each solution uЄ P if (ku) Sk = Sk U{u} if (uk)nk=nk End for +1 Step 1.2 //store the Pareto level 1 if n₁ =0 ₁ = End for {k} Step 2. //fetch the Pareto level 2 from Pareto level 1, and then fetch the Pareto level 3 from level 2, and so on. Step 2.1 i=1 Step 2.2 if (0), then ;+1 = 0. For each solution ke г; For each solution uЄ Sk nu-nu-1 if n₁ =0 г¡+₁ =П₁₁₁ ~{u} End for End for i+1 i+1 Step 2.3 i=i+1; go back to step 2.2

Language is c++  picture includes instructions and sample outputs with user inputs in bold

Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"

in c++ using only binary search