Write some Software

Write a set of Scheme definitions that implement a “movie queue”. A movie queue is a S list of movies each with a priority value that indicates the priority in which you wish to view the movie.( e.g. Netflix queue for sending DVDs to user) You can add and remove movies. You can change the priority value of the movie. If your movie queue has n movies, then the priority values of the movies in your queue must be an integer from 1 to n with no priority value used twice. You are not implementing a data structure queue but rather a list of movies with priorities. 1. A ( name priority ) tuple is called a movie. The name is a string representing the name of the movie and the priority is a positive integer representing the order in which you wish to view your movies. A movieQueue will be represented as a list movies with priorities 1 – n where n is the length of the list. There should be no duplicate movies. All integers 1 to n must be used once. For example: ( (“Star Wars”, 1 ) ( “Revenant” 2) ( “Zootopia” 3 ) ( “Creed” 4) (“Anomalisa” 5) ) or ( (“Star Wars”, 1 ) ( “Zootopia” 3 ) ( “Creed” 4) (“Anomalisa” 5) ( “Revenant” 2)) Write the following Scheme functions. a. (name m) // returns the name of the movie m b. (priority m ) //returns the priority of the movie m c. (compare m1 m2) returns #t if movie m1 has a lower priority than movie m2. Otherwise return #f. ... Please note, there are more functions and instructions - I will provide them to interested bidders.