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

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

Return the number of nodes having value less than n$.$

test case:

create the binary tree showj below, bst$=$

$5$

$27$

$14611$

$9$

n$=7,$ your function should return $2$