Hello

this quesion is related to Java

Please don't answer with your handwriting

thank you

Explain how we can apply Binary Search algorithm either directly or indirectly in the following cases: a) Array1 is an array of sorted integers numbers: (You must choose an element to show the steps) Array1: 15 7 13 16 2238 55 70 90 b) Array2 is an array of unsorted integers numbers (You can choose an element to show the steps) Array2: 300 20 121 30 110 25 122 200 250 20 c) Array3 is an array of Strings The order of sorting is alphabetical (e.g. "AA* before "BC" and "AA before "AB"). (You san choose an element to show the stespes) Array3