1 and 2 has the options and 3-5 has same

options. Thanks

Consider the following scenario involving a sequence of n insertions of entries into a sorted mop implemented as some version of a binary search tree (BST). The sequence of insertions is such that the keys of the entries are in ascending order that is, it is the key of the th entry inserted. then