This is Haskell

you may need to open the image in a new tab its way too large

Complete the missing parts (indicated by ??) in the following definition for a recursive function that decides if a list of integers is sorted, that is, if its elements are in numeric order. For example, sorted [1,2,2,3] should give True, and sorted (1,3,4,2] should give False. sorted .: [Int] -> Bool sorted [] = ?? sorted [x] = ?? sorted (x:y:25) = ?? && sorted ?? O a. False, True, and x