$8.($a$)$Define the function size $()$ that receives a binary Search Tree and returns the number of elements in the tree.

$($b$)$Define a function that receives a BST and an array structures of the same data type as parameters. The function returns true if the array and the BST have the same elements, otherwise a false value is returned by the function. Analyze the running time of your algorithm$/$code$.$