$1.$ What is the time complexity of the best case to insert a new value into a sorted linked list

with n links? Explain.

$2.$ The best case to determine the smallest value in an unsorted array ar with n elements is

O$(1)$ when the smallest value is in ar$[0].$ True or false?

$3.$ On average, how long will it take to sort n elements by inserting them into a sorted linked

list that is initially empty? Explain.

$4.$ What is the time complexity to remove the smallest value from an array with n elements

that is sorted from smallest to largest? Explain.

$5.$ Tree T shown below is a BST