Task 1: Implementation of search algorithms 1. Implement the following using function templates a. linearSearch This function should take as input an array and an item. Find b. binarySearch This function should also take as input an array and an item. 2. Test your implementation against arrays of different data types. Handle the condition and return the position of the item using linear search. Find and return the position of the item using binary search. where the item does not exist in the input array