Please Show Steps
![4. [5 marks] Analyzing the time complexity (Big-Oh) for the following code, what is the result when n equals to 10. int resul](https://media.cheggcdn.com/media%2F315%2F31593755-b072-4851-8550-873e4f6df09d%2FphpC54Cuu.png)
4. [5 marks] Analyzing the time complexity (Big-Oh) for the following code, what is the result when n equals to 10. int result 0; or -0 < n ++) int temp0 for (j = 0; j <= i; j++) temp-temp 2; result-result +temp; 5. [5 marks] Briefly describe an algorithm for removing duplicates from an array. Analyze the time complexity (Big-Oh) of the algorithm. 6. [5 marks] Briefly describe an algorithm for
OR
OR