$(30$ points$)$ Shuffling is a technique used to randomize the order of a deck of cards,

but the same techniques can be used to randomize the order of a list. Give pseudocode

for a list operation SHUFFLE that performs the following actions on the list:

The list $L$ is divided into two lists $L_1$ and $L_2.$

The lists are merged by picking the first node of either $L_1$ and $L_2$ at random, and

appending that node to the end of a new list, then repeating with the new first

nodes of the two lists.

You can make the following assumptions:

The list is implemented using a doubly$-$linked list.

The argument passed in is the "cut point" of the list, that is the first node of $L_2.$

You have access to a black$-$box function Random which outputs true and false

according to some probability distribution.