Reference no: EM133269869

a. Write a program `abstractsize` which inputs a datum and returns an integer measure of how much memory it occupies (cf. Question 10).

Note this measure should be in an abstract unit in which each integer occupies one unit of memory and each pair of square brackets occupies one unit of memory, modulo sharing, so that (for example) `[5,5]` has measure 3 --- one for the square brackets, and one for the two integer payloads. (Do not try to return actual memory usage in bytes, since this will depend on implementation and on the size of the integer payload!)

b. Write a program `compress` which inputs a datum, and outputs a datum that represents it

and minimises abstract size. Your code should be clear and well-commented with an

explanation (if required) of the algorithm you use.

We're not looking for precise bytecounts and certainly not looking for speed or optimal performance. Marks will be awarded for elegance, clear commenting, and understanding of the issues involved.