Let SORT $=\{[$L$,$ k$]|$ L is a list of comparable elements and k is the largest element$\}.$ Let is a list of comparable elements and $k$ is the largest element Prove that SORT is in P$.$ Assume that comparable elements are elements with values that can be determined to be less than, more than, or equal to each other $($these do not strictly have to be numerical values$).$ Give your runtime analysis with respect to n$,$ the length of the list L$.$