How exaclty do you determine this specific codes runtime is theta(n^2)??I can see theres two while loops which go from i and j to n but would like a more precise way of determing this? If someone could explain is simple terms as I am very new to this I would appreciate it. def f(n):i = 0  while i < n:   j = 0     while j < n:      j = j + 1 i = i + 5
Time complexity of nested loops help
algorithm analysis;runtime analysis;loops