A Scheme program that operates on list

The project is to write a Scheme function package that takes a list of elements (types are unimportant) and a positive number n that produce a list of lists consisting of elements from the original list in a specific way. For example, given the list of lists ((a b c) (d e f) (g h)), the position of b is (1, 2) and the position of f is (2, 3). The list of lists is obtained from the original list using the following formula: an element at position i in the original list should become the element at position (i modulo n, i/n), where / is integer division (throws away the remainder) and modulo is the remainder of integer division. For example, if the inputs to pacakge are (1 2 3 4 5 6 7) and 3, then package should produce ((1 4 7) (2 5) (3 6)). See attachement for detail. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform Must use DrScheme for this project.