Write a function, def find$($list$2$: DoublyLinkedList, $n$ : int$)->$ DoublyLinkedList: insert$()$ function accepts a sorted doubly linked list of integers and an integer, $n.$ If $n$ is in the list, return the number elements that are greater than or equal to $n,$ and the number of elements that are less than $n.$ If $n$ is not in the list, return the original list.

Run this function with the test case:

list $2$:$1$larr$3$larr$4$larr$8$larr$9$larr$10,n=8$

This function should return $2,3.$

Problem $3$ Stack and Queue: $(45$ pts$)$

$3.$ Write a function: def remove$($stack$1$: LinkedStack$)->$ LinkedStack:

remove$()$ function accepts a linked stack of integer and removes the maximum element in it$.$ Return the resulting stack.

Run this function with test case:

stack$1$:

$\backslash$table$[[5],[1],[4],[2],[6],[3]]$

This function should return

$\backslash$table$[[5],[1],[4],[2],[3]]$