In Java please![02.17 pts] Given an ordered for the following values (note: you need to show your work) array of 13 clements, apply binary se](https://media.cheggcdn.com/media%2Ff71%2Ff71da415-7480-445f-9596-5d631caa5f45%2Fimage.png)
02.17 pts] Given an ordered for the following values (note: you need to show your work) array of 13 clements, apply binary search on the array to search a) Key-11 b) Key-54 value 2 4 7 10 11 45 50 59 60 66 69 70 79 Q3 [10 points]: For each of the following Algorithms, find the complexity of the algorithm using big O notation. Choose from O(1), O(n log n), O(m),O(n2),O(log n).
OR
OR