Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
Answer: 545 words per 35 mins
Explanation:
1. ughhhh not entirely sure but B, 2. again not entirely sure should be B as well and finally 3.is D remember these are not always the answer just most likely what one person thinks
The answer is 9
Hope I helped you
