I need help answering this question? Think about the binary search tree, the hash table, and the linear array. When looking at overall efficiency of searching compare and contrast each structure. Which is the most efficient? Least? Why? If you had a programming assignment requiring you to design/develop a search method which do you use? Does it matter? What things do you use to decide? Clearly defend your answers. (Hint: think about best/average/worst case, additional required processing, etc.)