Trace: binary search

Line 1: values = [4, 9, 13, 18, 25, 31, 40, 47]1values = [4, 9, 13, 18, 25, 31, 40, 47]
Line 2: target = 132target = 13
Line 3: low = 03low = 0
Line 4: high = 74high = 7
Line 5: found = False5found = False
Line 6: while low <= high and not found:6while low <= high and not found:
Line 7, indented 1 level: mid = (low + high) // 27    mid = (low + high) // 2
Line 8, indented 1 level: if values[mid] == target:8    if values[mid] == target:
Line 9, indented 2 levels: found = True9        found = True
Line 10, indented 1 level: elif values[mid] < target:10    elif values[mid] < target:
Line 11, indented 2 levels: low = mid + 111        low = mid + 1
Line 12, indented 1 level: else:12    else:
Line 13, indented 2 levels: high = mid - 113        high = mid - 1
Line 14: print(mid)14print(mid)

Fill in one row each time a line changes low, high, mid or found, or prints something. The table already has the right number of rows. In each row, write only what that line changes; you can leave the other cells empty or copy their values down. Write values the way Python shows them: 3 and 3.0 are different, and text goes in quotes. In the output column, write exactly what appears on screen, with no quotes around it.