- Draw a Flowchart for linear search algorithm using PowerPoint. - If your array A has the following elements: 1,2,8,6,4, 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 1 in an array A. (How many trials to find this value?) - Find the value 6 in an array A. (How many trials to find this value?) - If the value is found, then: print out the following message "The element vou are looking for is found", otherwise, o print out the following message "Sorry, but the element you are looking for is not found", - Should you sort the array before searching? Begin Variables i,x : integer, Find: boolean; i=0, Find = false, read: x; /N =number of elements in the arrosy While (i<>