Need help with these two implementations using the same method headers them being "quickBST(L)" and "isBST(T)" not changing these headers or signatures!!. class BST: is a helper method that contains the certain available methods. Lastly the trees part is the test cases and below them the expected outcomes.

from google.colab import files bst.py oaded_files = files.upload () import bst Choose Files bst.py - bst.py(text/x-python-script) - 5057 bytes, last modified: 2/21/2023 - 100\% done Saving bst.py to bst (1) -py Write the function quick BST(L) that receives a list L and builds and returns a binary search tree with the elements of L without using the insert operation. Your function must work as follows: Write the function isBST(t) that receives a binary tree t and determines if t is a binary search tree. For example, your function should return True if it receives the tree on the left and False if it receives the tree on the right (since key 68 is on the left subtree of key 66). Do this by extracting the in-order traversal of the tree to a Python list and checking to see if the list is sorted. Your function must run in time O(n) (no credi will be given if it takes longer than that)