Question 1 (10 marks): - Draw a Flowchart for binary search algorithm using PowerPoint. - If your array A has the following elements: 5,7,10,15,20,35,37,100, trace your algorithm in these three cases: - Find the value 9 in an array A. (How many trials to find this value?) - Find the value 5 in an array A. (How many trials to find this value?) - Find the value 20 in an array A. (How many trials to find this value?) - If the value is found, then: print out the following message "The element you are looking for is found", otherwise, print out the following message "Sorry, but the element you are looking for is not found" - Should you sort the array before searching