5 Weight: 25%) PROGRAMMING-Using the single-linked list shown in the figure below, and assuming that head references the first Node and tail references the last Node, write statements to do each of the following. a. Insert "Bill" before "Tom" (You have a reference to the head (Tom). b. Insert "Sue" before "Sam" (You only have a reference to Sam and the head). c. Remove "Bill". d. Remove "Sam" (You only have a reference to the head and Sam). Node Node Node Node next = data="Sam" next next = data="Tom" next = 1 data="John" data "Harry