For a tiny memory system with 32 bytes of memory, 4 byte cache blocks of fully-associative cache, and 8 bytes of cache:

How many bits required for the address?

How many blocks in the cache?

How many blocks in the memory?

Draw a diagram of the cache memory system that shows:

Memory Addresses for each of the 32 bytes (in binary)

The cache structure

The memory address structure with the number of bits for each piece of the address

What is compared to what when checking for an address in the cache.

Now populate your memory with the lower case letters of the alphabet, followed by digits, both in ascending order. Start the population with the first (lowest address) memory location.

Now load the cache with the first and fourth memory blocks.

The CPU generates address 01101. Is it in the cache? Explain what the CPU does to determine this.

If the memory block is currently in the cache, what character is found at the above address?

Please answer the whole thing not just the first part I need the second part as well