Create a program in C$++$ which simulates a direct cache. The memory array that contains the data to be cached is byte addressable and can contain $256$ single byte entries or lines. The cache has only $8$ entries or lines. The Data field in each line of the cache is $8$ bits. Since the data stored in each line of the cache is only $8$ bits, there is no need for a line field. Only a tag field is needed which is log$2(256)=8$ bits.

The memory array can be filled with any values of your choice. The program should work by taking user input of a memory address $($index$).$ This input represents the memory data that should be cached. Your program will check the cache to see if the item is already cached. If it is not, your program should count a cache miss, and then replace the item currently in the cache with the data from the inputted address. Allow the user to input addresses $($in a loop$),$ until they so choose to end the program. The program should output the number of cache misses upon ending.