Using a singly linked list implementation of a bag of characters, write the insert, delete, copy, print, and recursive print functions. A bag is a set with the property that duplicate elements are allowed. Assume that the bag has been created. The integer field contains the ASCII value of the character in the character field. The definition of the struct is: struct node { char betaval; int ascbetaval; node *link; }; Using a singly linked list, write a program that will rotate the linked list counter-clockwise by K nodes. Where K is a given positive integer. Eg. If the given linked list is: 1 2 3 4 5, and K is 3, The list should be modified to: 4 5 1 2 3 Assume that k is smaller than the number of nodes in the linked list.