Show that each of the following languages (comprised of strings over the alphabet ={0,1} ) are decidable, by describing an algorithm that accepts every string in the language, and rejects every string not in the language. (Pseudocode is not necessary. As usual, x denotes an unambiguous encoding of object x as a string over the alphabet .) Your algorithm does not need to be efficient. Just describe what it does and briefly justify any non-obvious aspects relating to correctness. As an example, we may decide the language L={A:A is a sorted array of integers } as follows. Given an integer array A[1,,n], check if A[i]A[i+1] for all 1i<.>