figure an empty list figure linked list of integers def __init__(self)self head none initially when we construct listthere are no items the assignment statement mylist unorderedlist(creates the linked list representation shown in figure as we discussed in the node classthe special reference none will again be used to state that the head of the list does not refer to anything eventuallythe example list given earlier will be represented by linked list as shown in figure the head of the list refers to the first node which contains the first item of the list in turnthat node holds reference to the next node (the next itemand so on it is very important to note that the list class itself does not contain any node objects instead it contains single reference to only the first node in the linked structure the is_empty method simply checks to see if the head of the list is reference to none the result of the boolean expression self head==none will only be true if there are no nodes in the linked list since new list is emptythe constructor and the check for empty must be consistent with one another this shows the advantage to using the reference none to denote the "endof the linked structure in pythonnone can be compared to any reference two references are equal if they both refer to the same object we will use this often in our remaining methods def is_empty(self)return self head =none sohow do we get items into our listwe need to implement the add method howeverbefore we can do thatwe need to address the important question of where in the linked list to place the new item since this list is unorderedthe specific location of the new item with respect to the other items already in the list is not important the new item can go anywhere with that in mindit makes sense to place the new item in the easiest location possible implementing an unordered listlinked lists