plz answer all the questions

- Draw a Flowchart for linear search algorithm sing PowerPoint. - If your array A has the following elements: 1,2,8,6,4, trace your algor 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: o print out the following message "The element you are looking for otherwise, print out the following message "Sorry, but the element vou are ! not found" - Should you sort the array before searching