A min-heap is useful when we are interested in the minimum value of set of numbers. Now, instead of the min, we are interesting in the K-th smallest value. a. Please design a data structure to allow the following two operations: push (insert a new number) and find_Kmin (return the value of the K-th smallest number without removing it). Both operations should be done in O(log K) time.
b. In addition to push and find_Kmin, now we also want to support the pop operation to return and remove the K-th smallest element. Please design a data structure to support these three operations, and each operation should take O(log n) time with n being the size of the current set.

For question 1, i'm a bit stuck between serif fonts or large enough type to read. serif fonts are good fonts to use because their easy to read. but you also need your type be large enough to read. if i had to say what you need to consider most important, i would say d is the answer.  for question 3, i believe the answer is d. it seems most appropriate to do that. on every page or every other page would be too much, and only on the contact page just seems inappropriate.  for question 4, it's probably a. by "color scheme" it doesn't mean just one color, but a set of colors. colors that are complimentary to each other. having too many is too distracting so it's best to limit it as much as possible, but not to the point where your website looks dull.hope this !