Use R5RS pls! Thank U so much!

Part 1 - Making a list of numbers from 2 ton Create a function named make-2-n-list that takes in one parameter, the end number. It should return a list of numbers from 2 to that number. (make-2-n-list 30) + (2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30) Hint: make a function that makes the list backwards (easy right-fold pattern), then look at your recursive case and think backwards. Part 1 - Making a list of numbers from 2 ton Create a function named make-2-n-list that takes in one parameter, the end number. It should return a list of numbers from 2 to that number. (make-2-n-list 30) + (2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30) Hint: make a function that makes the list backwards (easy right-fold pattern), then look at your recursive case and think backwards. Part 1 - Making a list of numbers from 2 ton Create a function named make-2-n-list that takes in one parameter, the end number. It should return a list of numbers from 2 to that number. (make-2-n-list 30) + (2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30) Hint: make a function that makes the list backwards (easy right-fold pattern), then look at your recursive case and think backwards. Part 1 - Making a list of numbers from 2 ton Create a function named make-2-n-list that takes in one parameter, the end number. It should return a list of numbers from 2 to that number. (make-2-n-list 30) + (2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30) Hint: make a function that makes the list backwards (easy right-fold pattern), then look at your recursive case and think backwards