This Question is based on the algorithm provided in the image Suppose T is a binary search tree with m nodes, A is an array with n elements, and a procedure P employs the Tree-Insert procedure asin above "image" repeatedly to insert all elements of A into T, one after the other. What are the worst-case and best-case running times of P? Express your answers in terms of m and n, and give brief justifications

Insertion To insert a new value v into a binary search tree T, we use the procedure TREE- INSERT. The procedure takes a node z for which .kev = v, z.left NIL. and z. right NIL. It modifies T and some of the attributes of z in such a way that it inserts z into an appropriate position in the tree. TREE-INSERT (T, z) 3 while x NIL 4 if z.key