Suppose you had an 8-bit computer system with a 256 Byte main memory and a 32 byte 2-way Set Associative cache with a line size of 2 Bytes which uses LRU to manage the contents of the sets. Assuming that the cache starts out completely empty, which of the following memory accesses would be hits and misses? (each address is given in binary)1001001001101101011011101010 00110110111111011100100100110101110 0110111010110110111011100

Print "censored" if userinput contains the word "darn", else print userinput. end with newline. ex: if userinput is "that darn cat.", then output is: censoredex: if userinput is "dang, that was scary! ", then output is: dang, that was scary! note: if the submitted code has an out-of-range access, the system will stop running the code after a few seconds, and report "program end never reached." the system doesn't print the test case that caused the reported message.#include #include using namespace std; int main() {string userinput; getline(cin, userinput); int ispresent = userinput.find("darn"); if (ispresent > 0){cout < < "censored" < < endl; /* your solution goes here */return 0; }