binary search is an efficient algorithm for finding an item from a sorted list of items. Your task is to implement binary search. Specifically, you are required to:

$1.$ Create a class called SearchingAlgorithm

$2.$ Implement a method binarySearch that finds whether a given integer is in the list of integers or not.

$3.$ Create an array of $10$ non$-$sorted integers, e$.$g$.,[34,20,14,50,24,-1,4,95,30,55]$

$4.$ Sort the array using any of the sorting algorithms and then run binary search on the sorted list, e$.$g$.,$ finding whether $20$ is in the list or not.