For the given dataset analyze Binary Search Algorithm. Find Complexity function, Big Oh (0) notation and Running Time. Also describe for which element of the dataset Binary Search Algorithm will take the largest number of comparisons. Follow this equation for finding the mid position of dataset, Mid=floor((Beg+End)/2). Start your index counting from 1 to n.

Dataset S= {23, 34, 56, 123, 789, 3245, 90900, 1234567, 1234597}