PYTHON Problem $2$ Binary Search Tree $(35$ pts$)$:

Write a function, def find$\_$bigger$\_$count$($bst: BinarySearchTree, $n$ : int$)->$ int:

find$\_$bigger$\_$count$()$ function takes a binary search tree of integers, and an integer value, $n.$ Return

the number of nodes having values less than $n.$

Test case:

Create the binary tree shown below, bst $=$

$n=7,$ your function should return $5.(15$ pts$)$

Write a function, def create$\_$copy$($bst: BinarySearchTree$)>$ BinarySearchTree:

create$\_$copy$()$ function takes a binary search tree of integers. Create an identical bi ary seorch tree ct

this tree $($NOT the same object$).$

Test case:

Create the binary tree shown below, bst $=$