3 Alternative Linked Lists Question 8: 8 points If the linked list's last node does not have next assigned as NULL, but rather another node in the list, we have a circular linked list. Write Python code to create a circular linked list of three nodes, containing the values 1, 2, and 3. 1's node should point to 2's node, 2's node should point to 3's node, and 3's node should point back to l's node. l's node should be the top of the list. Question 9: 8 points If we create a linked list with nodes that have pointers to the next and previous nodes, we can move forwards and backwards through the linked list. Doubly linked lists require more overhead because each node has an extra field. But they're more convenient because they allow for bi-directional traversal - though we'll also need to keep a pointer to the last node in the list (the tail) to do this effectively. Suppose we had functions to create doubly linked lists. Say we inserted the values 2, 4, and 6 (and we inserted each value at the back of the list, so the value became the new tail). Draw a picture of the pointers in the doubly linked list. Question 10 : 8 points Write a Python function called num Pos. This function should take the top of a doubly linked list as an argument and return the number of items whose value is greater than 0