a$)$

Design a Menu Driven based approach for the following operations: a$.$ Print all the elements at even positions with the position of the first element assumed to

be $0.$ Do this for a single pass of the linked list. Sample

Input: Output: $12-18-19-22->$ NULL

$12-15-18-17-19-20->22->$NULL

b$)$ Design an algorithm to print the information stored in all the nodes in a singly linked list

c$)$

write a recursive algorithm to perform traversal operation on a single linked list Write