1. A total of 100 integer elements are chosen at random and inserted into a sorted linked list and a binary search tree.

Describe the efficiency of searching for an element in each structure, in terms of Big-O notation. 2. A total of 100 integer elements are inserted in order, from smallest to largest, into a sorted linked list and a binary search tree. Describe the efficiency of searching for an element in each structure, in terms of Big-O notation.