Using Python language

Alternate Merge

You are given two singly non$-$dummy headed linked lists. Your task is to write a function

alternate$\_$merge$($head$1,$ head$2)$ that takes the heads of the two linked lists and returns the

head of a modified linked list with all the elements of the two lists in alternate order. It is

guaranteed that alternate placement is always possible. Your resulting linked list will always

start with the head of linked list $1.$

Sum of Nodes

You are given a Linked List, LL$1,$ and an array, dist. Write a method sum$\_$dist$($list$,$ arr$)$ that

takes a Linked List and an array as parameters. This method sums the node elements in the

linked list that are away from the head by the elements in the array and returns the sum. Assume

the Node class has only elem and next variable. No need to write Node class and driver code.