HELP (PYTHON): Implementing an iterator for the doubly linked list

Implement an iterator class, LinkedListIterator that will traverse the linked list from the first node in the list to the last node in the list. The LinkedListDLL class should return an instance of the LinkedListIterator such that it is compatible with a for loop as shown in the example below. The iterator should stop traversal once every node in the list has been visited.

This will produce the output:

Contents: 8 6 4 2 1 3 5 7 9

Contents: 6 4 2 1 3 5

my-list-LinkedListDLL() for node in my list: print (node,end-"") print () for x in range (1,10) if x % 2-0: my_list.add_to_head (x) else: my list.add to tai1 (x) 11 Im print(" Contents:",end-"") for node in my list: print (node,end-"") print () my list.remove from head my list.remove from tail () my list.remove from tail print(" Contents:",end-" ") for node in my list: 1 Im print (node,end") print ()