THIS IS MY FOURTH ATTEMPT TO GET AN ANSWER FOR THIS QUESTION!! THE ANSWERS I'VE GOTTEN SO FAR ARE NOT EVEN THE CORRECT PROGRAMMING LANGUAGE. IF THIS IS ANSWERED INCORRECTLY, I WILL REPORT YOU AND DISLIKE.

!!TEST YOUR CODE BEFORE ANSWERING!!

!!!PLEASE FOLLOW THE INSTRUCTIONS THOROUGHLY!!! THIS QUESTION IS WORTH A LOT OF POINTS!!!

*IMPORTANT NOTICE* Please use Scheme programming, Language: R5RS (THIS IS IMPORTANT), with Dr. Racket!!!

THIS IS MY FOURTH ATTEMPT TO GET AN ANSWER FOR THIS QUESTION!! THE ANSWERS I'VE GOTTEN SO FAR ARE NOT EVEN THE CORRECT PROGRAMMING LANGUAGE. IF THIS IS ANSWERED INCORRECTLY, I WILL REPORT YOU AND DISLIKE.

!!TEST YOUR CODE BEFORE ANSWERING!!

!!!PLEASE FOLLOW THE INSTRUCTIONS THOROUGHLY!!! THIS QUESTION IS WORTH A LOT OF POINTS!!!

*IMPORTANT NOTICE* Please use Scheme programming, Language: R5RS (THIS IS IMPORTANT), with Dr. Racket!!!

Create a procedure called (list-shuffle lst1 lst2) which returns the perfect shuffle of two lists. The perfect shuffle of two lists is a new list created by alternately picking elements from one of the two input lists. Since it is a perfect shuffle, assume both lists have the same length. Add comments to describe how your algorithm for generating the perfect shuffle works. Sample output: (list-shuffle '(1 2) '(a b)) is '(1 a 2 b). [20 points total; 15 points for implementation, 5 for comments.]

6. Create a procedure called (list-shuffle Ist1 Ist2) which returns the perfect shuffle of two lists. The perfect shuffle of two lists is a new list created by alternately picking elements from one of the two input lists. Since it is a perfect shuffle, assume both lists have the same length. Add comments to describe how your algorithm for generating the perfect shuffle works. Sample output: (list-shuffle '(1 2) '(a b)) is '(1 a 2 b). [20 points total; 15 points for implementation, 5 for comments.)