$2.<5\mathrm{.}0$ pts$>$ Given: $256$KB cache, direct mapped, $64$ bytes$/$block and a $32-$bit total address space. $($Same cache except it is direct mapped$)$

$2.$a$.(0\mathrm{.}5$ pts$)$ Given its size, how many bits of address space would be required to directly access each byte in the cache if it were like regular memory?

$2.$b$.(0\mathrm{.}5$ pts$)$ How many blocks in the cache?

$2.$c$.(0\mathrm{.}5$ pts$)$ How many bits needed for the block offset?

$2.$d$.(0\mathrm{.}5$ pts$)$ How many bits are used for the indexes?

$2.$e$.(0\mathrm{.}5$ pts$)$ How many bits are in the tag?

$2.$f$.(0\mathrm{.}5$ pts$)$ How many sets? $($i$.$e$.$ rows$)$

$2.$g$.(0\mathrm{.}5$ pts$)$ How many possible different tags?

$2.$h$.(0\mathrm{.}5$ pts$)$ Valid bits require additional physical cache memory since they must be stored in the cache. This is called overhead. How many BYTES of storage are required to store all the valid bits?

$2.$i$.(0\mathrm{.}5$ pts$)$ Tag bits also require additional physical cache memory since they must be stored in the cache. How many BYTES of storage are required to store all the tag bits?

$2.$j$.(0\mathrm{.}5$ pts$)$ What is the total amount of memory required to implement this cache?