Assume a fully associative write-back cache with many cache entries that starts empty. Below is a sequence of eleven memory operations (the address is in square brackets): What are the number of hits and misses when using no-write allocate versus write allocate? True/False a. All lower level memories always have inclusion property. b. In case of read miss, the word is saved in cache before continuing c. A fully associative cache has just one block d. In set association, a block can be replaced in any of the sets. e. For the same cache, decreasing the associativity decreases the size of index field