QUESTION $3$

A Fully Associative cache has a total capacity of $12$ KB and block size of $2$ KB $.$ How many ways are there in this cache? $($answer in decimal, such as $2)$ How many bits of the memory addresses are used for tag? $($answer in decimal, such as $14)$ How many bits of storage are needed for this cache to store all the tag bits? $($answer in decimal, such as $34)$ When accessing memory address $0$xAB$12$DE$64,$ the tag part of this address is $0.($answer in hex$).$ If this access is a cache miss, then is it possible that right before this access all the blocks in the cache have valid $=1?(\frac{y}{n})$