Choose The Appropriate Code Snippet That Performs Uniform #480

 public static int unisearch(int key) { int i = delta[0] - 1; int j = 0; while (true) { if (key == arr[i]) return i; else if (delta[j] == 0) return -1; else { if (key < arr[i]) i += delta[++j]; else i -= delta[++j]; } } }

 public static int unisearch(int key) { int i = delta[1] - 1; int j = 0; while (true) { if (key == arr[i]) return i; else if (delta[j] == 0) return -1; else { if (key < arr[i]) i -= delta[++j]; else i += delta[++j]; } } }

 public static int unisearch(int key) { int i = delta[0] - 1; int j = 0; while (true) { if (key == arr[i]) return i; else if (delta[j] == 0) return -1; else { if (key < arr[i]) i -= delta[++j]; else i += delta[++j]; } } }

 public static int unisearch(int key) { int i = delta[0] - 1; int j = 0; while (true) { if (key == arr[i]) return i; else if (delta[j] == 0) return -1; else { if (key < arr[i]) i += delta[++j]; else i += delta[++j]; } } }