1 class (you can call it whatever you like) put all 3 parts below in the class. A "counter" (you can name it counter) varaible that can be incremented to go from 1 to some number. All 3 parts can be ...

precondition: haystack is guaranteed to be in sorted order before running the function algorithm: find the middle element in the list (choose either middle element if there are two), check if it is ...