In main$(),$ use a list comprehension to create a list object called "alphabet", it is an alphabetical list of the $26$ lowercase letters of the English alphabet, each letter of the alphabet will be a separate item in the list. No cheating, you must construct it using a list comprehension and it will take exactly one line of code. You should construct the list comprehension using chr$(),$ as in the modules, or you can explore the string package and use string.ascii$\_$lowercase.

For the remainder of the program, we will use this code exactly:

print$($alphabet$)$

print$($reverse$\_$a$\_$list$($alphabet$))$

print$($alphabet$)$

And the result should be the alphabet printed forward $($as a list$),$ then backward $($reverse order$),$ then forward again.

Of course, this will not work until you implement the function "reverse$\_$a$\_$list$($my$\_$list$)"$

Here are the requirements for reverse$\_$a$\_$list$($my$\_$list$)$

The first line of the function should be print$($f$"$The length of my$\_$list is now: $\{$len$($my$\_$list$)\}").$ USUALLY we don't want to have a function like this output anything, but this will just help you and I evaluate whether the function is doing what it is supposed to do$.$

The function must call itself with a smaller list until the length of my$\_$list is $1$

The function should return a new list in reverse order, leaving the original list in its original order

To be most elegant, your function needs to use some slicing and some list concatenation

The recursion should not be trivial. That is$,$ each function should rely on the next level of recursion to help it construct the reversed list. It is not sufficient to use a list method or a slice reversal to solve this assignment.