Question $5$

Programming in Julia or Python.

pairs$($lst$)$: This function splits lst into $2-$element groups from left to right, and returns a list of such groups. If the size of $1$ st is an odd number, then the last group only contains one element. For example, for $1$ st $=[a,b,c,d,e,f,g],$ the returned list is $\left[\begin{array}{cc}a& b\\ c& d\\ e& f\\ g& ?\end{array}\right].$

almost$\_$sorted$($lst$)$: This function checks if a given list of different integers is almost sorted. A list of different integers is said to be sorted if the integers occur in strictly increasing or decreasing order. A list of integers is said to be almost sorted if it is already sorted or the resulting list is sorted after any one of its elements is deleted from the list.

gen$(n)($extra $5$ points$)$: This function returns a list of all possible n $-$bit binary strings that do not contain the substring $"11".$ The order of the strings in the list is not important.