Consider an array-based implementation of the sorted list. To implement the method add, you must add an entry to a sorted array so that the array remains sorted.
a. Describe the steps in this implementation.
b. On which sort have you based your logic?
c. Analyze the worst-case efficiency of this implementation of add.