Which of the following is not true about a Binary Search

		The algorithm calculates the middle index
		The value you are searching for is located in the middle of the array causes the shortest execution of a binary search looking for a value in an array of integers
		The all values in array must be in unsorted order to perform a binary search
		The value that you are searching for is located in the last position in the array or the value you are searching for isn't in the array causes the longest execution of a binary search
		All of the above are true