All parts must be answered, otherwise i will not upvote. thank you.

a) Write the following expression in postfix (reverse Polish) notation. Remember the rules of precedence for arithmetic operators! X = (A-B+C*(D*E-F))/(G+H*K) b) Write a program to evaluate the above arithmetic statement using a stack organized computer with zero-address instructions (so only Pop and Push can access memory). Suppose we have a computer that uses a memory address word size of 8 bits. This computer has a 16-byte cache with 4 bytes per block. The computer accesses a number of memory locations throughout the course of running a program. Suppose the computer uses direct-mapped cache. The format of a memory address as seen by the cache is shown here. 4 bits Block 2 bit 2 bits The system accesses memory addresses in this exact order: 0x6E, OxB9, 0x17, 0xE0, 0x4E, 0x4F, 0x50,0x91, OxA8, OxA9, OxAB, OxAD, 0x93, and 0x94. The memory addresses of the first four accesses have been loaded into the cache blocks as shown below. (The contents of the tag are shown in binary, and the cache "contents are simply the address stored at that cache location.) DA b) What memory blocks will be in the cache after the last address has been accessed