Suppose that an element is known to be among the first four elements in a list of 32 elements that are ordered increasingly. Would a linear search or a binary search locate this element quickly

Suppose a cpu with a write-through, write-allocate cache achieves a cpi of 2. what are the read and write bandwidths (measured by bytes per cycle) between ram and the cache? (assume each miss generates a request for one block.)