Please use Python and template provided below. A screenshot with your results would be greatly appreciated. Thank you Chegg people!

Need help with Problem #2, #3, #4, and #5.

Problem 2: transform(est) Given a linked list, transform it into a Python list. The head of the linked list corresponds to the left of the Python list. When the input linked list is empty, the output Python list should be empty as well. Example: When the input linked list is 1 + 2 + 3, the output Python list should be [1,2,3] . 1 Problem 3: concatenate(lst1, Ist2) Given two (possibly empty) linked lists, concatenate them such that the first list comes first. Example: When the first input linked list Ist1 is 1 + 2 + 3 and the second lst2 is 7 + 8 + 9, the output linked list is 1 +2 +3 + 7 + 8 + 9. Problem 4: removeNodesFrom Beginning(lst, n) Remove the first n nodes from a (possible empty) linked list. Note: 0 0 i20 i+n = 0, n >= 0. Input: lst an unrdered list i a non-negative integer a non-negative integer n