Please answer questions referencing Java----

If a sorting or search algorithm is easy to understand it is usually ____ to implement and ____ efficient than a more complicated sorting or searching algorithm.

If an algorithm is completely independent of the number of elements in the array, it is said to have a(n) ____ run time.

A Big O of O(n²) is said to have a(n) _____ run time.

In what sense is the insertion sort superior to the merge sort? In what sense is the merge sort superior to the insertion sort?