Ex. 3 What is the time complexity, in terms of O notation, of the following algorithms as n → 0. Each algorithm takes a natural number n as input. Write down the time that each loop requires, the...

Extracted text: Ex. 3 What is the time complexity, in terms of O notation, of the following algorithms as n → 0. Each algorithm takes a natural number n as input. Write down the time that each loop requires, the equation describing the overall complexity, and the final result (e.g. T(n) = 5n + 2n? = 0(n²)). Algorithm 1 1 i = 1 2 while i < 4n³="" i="i" +2="" 2vi="" 3="" 4="" i="" 5="" while="" i=""> 5 for j = i to i + 10 i — і — 1 6. 7 1 to log n2 for j = 1 to n· i 8 for i 9. 10 x = 0