(Solved): This is a C++ question, please do not provide the answer that is not related Program below shows a ...

This is a C++ question, please do not provide the answer that is not related

Program below shows a code that the outer loop will run for \( \mathrm{n} \) number of iterations. In each iteration of the outer loop, the inner loop will run for \( n \) iterations of their own. State and justify the time complexity of the code. (3 marks) How many recursive calls are made when computing the sum of the list \( [2,4,6,8,10] \) ? Justify your answer. (4 marks)