write a pseudocode and explain why it works as well as itstime complexity. Thanks! Consider an unsorted array so that \( \mathrm{M} \) is the maximum and \( \mathrm{m} \) is the minimum. Say that the number of elements is \( n \). 1. Show that there are two elements \( A[i] \) and \ 1 answer