Respuesta :

tonb

They are already alphabetically ordered, which is optimal for insertion sort because insertion sort will go through the list only once, i.e. O(n).