2) A map A) can be implemented with an array B) can be implemented with a hash table C) can be implemented with a queue D) has widely variable performance based on its underlying storage structure E) must be colorable in four colors or less 13) In a skip-list, A) one must be sure to have a heavy but pliable rope B) one must have a fair coin to flip C) some values don't reach to all levels and are considered skipped D) the towers are of logarithmic height- at most E) we build towers of doubly-linked lists