Use DrRacket for programming. my-curry: implement your own version of curry. Your version should behave identically to curry, but need only work on procedures with fixed arity. E.g., > ((my-curry even?) 2) #t > (((my-curry cons) 1) 2) '(1 . 2) > ((my-curry cons 1) 2) '(1 . 2)   Starter Code: (define (my-curry f . rest)

Implementation of largest-cover difference #23@title Implementation of largest-cover difference def rectangle_difference(r, t): "Computes the rectangle difference rt, and outputs the result as a list of rectangles." assert len(r) == len(t), "Rectangles have different dimensions" ### YOUR SOLUTION HERE In the above code, we notice how it paid off to encapsulate intervals in their own abstraction. Now that we need to reason about rectangles, we do not need to get bogged down into complicated considerations of how to perform difference; the comparisons between endpoints are all done in the context of intervals, where it is easier to reason about them. It is often the case that problems become easy, once you think at them in the appropriate context. It is much easier to develop the code for the difference of intervals, as we have done, and then move on to difference of rectangles, rather than trying to write code for rectangle difference directly. The result is also far more elegant. # Let…

Write tests and implement

Specify and implement an iterator method called sortedElements for IntSet. The iterator method sortedElements returns an iterator that will produce each element of the intset in ascending order. The intset cannot be mutated when the iterator is in use.      Be sure to specify the iterator method before implementation. Do not forget to give the rep invariant and abstraction function for your implementation.   Note: IntSet.java has been provided.  You can directly add in the code the specification, the implementation of the iterator method sortedElements, and the inner iterator class.      There is a segment of simple testing code for sortedElements in main() close to the end in the provided IntSet.java.  The program will not compile until you have properly implemented sortedElements. find the provided code below: https://drive.google.com/open?id=1hANO8kVigGXwFLLJDJQLE5joM1BBeCCn