Problem statement: Write an algorithm / code to merge two linked lists of students. The data part in each node of the first linked list, say male_lis, consists of MALE student's information (name, id, program). Similarly, the data part in each node of the other list, say female_list, consists of the information of FEMALE students. These linked lists should be merged such that, in the resultant_list no two MALE or FEMALE records are consecutive. Assume both input lists have equal length. [Hint: traverse both the lists step-by- step starting from their head nodes, and add item from appropriate list to the resultant list.]