Trace: binary search missing (Java)

Line 1: int[] values = {6, 11, 15, 22, 28, 35, 41};1int[] values = {6, 11, 15, 22, 28, 35, 41};
Line 2: int target = 30;2int target = 30;
Line 3: int low = 0;3int low = 0;
Line 4: int high = values.length - 1;4int high = values.length - 1;
Line 5: boolean found = false;5boolean found = false;
Line 6: while (low <= high && !found) {6while (low <= high && !found) {
Line 7, indented 1 level: int mid = (low + high) / 2;7    int mid = (low + high) / 2;
Line 8, indented 1 level: if (values[mid] == target) {8    if (values[mid] == target) {
Line 9, indented 2 levels: found = true;9        found = true;
Line 10, indented 1 level: } else if (values[mid] < target) {10    } else if (values[mid] < target) {
Line 11, indented 2 levels: low = mid + 1;11        low = mid + 1;
Line 12, indented 1 level: } else {12    } else {
Line 13, indented 2 levels: high = mid - 1;13        high = mid - 1;
Line 14, indented 1 level: }14    }
Line 15: }15}

Fill in one row each time a line changes low, high or mid. 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 Java shows them: 3 and 3.0 are different, and text goes in quotes.