LAB 4 - LINKED LIST (PART 3)

Can you please tell me what I must do to implement Part 3, I'm not sure how to do the exceptions.

111= Linkedi.ist ([0,1,2,3,4]) print (111) \# note the order 4s preserued betow LinkedList: Head:Node(0)Tad1:Node(4)0>1>2>3>4None You will also need to add parameters for tracking the head (_head), tail (_tail), and length (_1en). You should name the parameters as given here, so the provided methods len, iter, and repr will work, Part 2 - Adding and removing Next, implement add_first(item), add_last (item), and remove_first (). All 3 methods should run in O(1). Part 3 - Exceptions remove_ irst () should raise a RuntimeError if called on an empty Linkedlist. Submitting At a minimum, subrit the following files: - Laba.py Stadents mut submit individually by the due date (typically, Sunday at 11:59 pm EST) to receive eredit