Suppose integers arrive in the following order for insertion in a binary tree with an ordering property: 72 38 25 66 tl 100 5 3 2 ttz 7t 29 7 6 24 Then delete 38, 12 and25. Draw the resulting tree (final state after insertions and step by step for deletions), discuss its fullness, and categorize its search efficiency in Big-O terms.

Write the command that can be used to answer the following questions. (hint: try each out on the system to check your results.) a. find all files on the system that have the word test" as part of their filename. b. search the path variable for the pathname to the awk command. c. find all files in the /usr directory and subdirectories that are larger than 50 kilobytes in size. d. find all files in the /usr directory and subdirectories that are less than 70 kilobytes in size. e. find all files in the / directory and subdirectories that are symbolic links. f. find all files in the /var directory and subdirectories that were accessed less than 60 minutes ago. g. find all files in the /var directory and subdirectories that were accessed less than six days ago. h. find all files in the /home directory and subdirectories that are empty. i. find all files in the /etc directory and subdirectories that are owned by the group bin."