We run the following algorithm on a Binary Search Tree: algorithm FindSomething (node, count, k) if (node is NULL) return null end if let left Find Something (node.left, count, k) if (left is not NULL) return left end if count = count + 1 if (count == k) return node end if return FindSomething (node.right, count, k) end algorithm let k be a positive integer number TheNode = FindSomething (root, 0, k). What does the algorithm return? What is its runtime complexity? Activ Go to