$3.$ Given the pre$-$order traversal of any Binary Search Tree $($BST$),$

i$.(4$ marks$)$ Write an algorithm to construct the Binary Search Tree

ii$.(1$ mark$)$ Calculate the time complexity of the algorithm. $($Remember to

include the number of operations per node$)$

iii. $(2$ marks$)$ Apply your algorithm on the pre$-$order traversal of a BST given

below and draw the BST constructed according to your algorithm.

List of nodes in the order Pre$-$order traversal $10,3,1,7,5,8,11,13,12$