3. Create a single link list of 10 elements, where 5 elements are added from head and five elements are added after tail. Traverse the link list and print the elements. Search the largest element of the linked list, delete it and print the elements of the linked list again. Finally delete the whole linked list to clear the memory. 4