Requirements:
1)	The program must use STL list and string classes;
2)	The program must implement Search function
3)	The Search function has to be a template
4)	The function must declare three parameters: aList to search in, starting iterator position, and the value to search for
5)	The function must return iterator position of the search value in the list
6)	The function must throw an exception if the value is not found in the list
7)	The exception must be caught and reported in the main
8)	The function must search the list recursively

Tips:
1)	When outputting iterator value pos use distance(myList.begin(), pos) function to obtain the ‘index’ of the element in the list (defined in <list> header).
2)	Use typename list<T>::iterator to declare iterator as a parameter or return type in template function.