Consider a memory with a 32 bit address, 128 bytes per block, and 2048 blocks in the cache. For direct mapped and 2-way set associative, for Part i, show the logical partitioning of the memory address into byte offset, cache index, and tag components. For Part ii, how any bits are needed to create this cache (Hint: Add up the valid, tag and data bits)

Write a function so that the main0 code below can be replaced by the simpler code that calls function mphandminutes tomiles0. original main0 int main) l double milesperhour-70.0; double minutestraveled = 100.0; double hourstraveled; double milestraveled; hourstraveled = minutestraveled / 60.0; milestraveled = hourstraveled * milesperhour; cout < "miles" 2 using namespace std; 4 /* your solution goes here/ 6 int maino 1 test passed 7 double milesperhour 70.0 all tests passed 8 double minutestraveled 100.0; 10 cout < < "miles: " < < mphandminutestomiles(milesper-hour, minutestraveled) < < endl; 12 return 0; 13