Alice p. hacker has two types of memory that she's using to build her system to store her objects. the first type, type a is extremely fast, but it's expensive and she doesn't have much of it. she has 10gb of type a memory that can being used to store objects, and reading an object from this memory takes 5ms. the second type of memory, type z, is a lot slower, but it's cheap, and so alice bought a lot of it. she has 1tb of the second type of memory that she can use to store objects, and reading an object from this memory takes 200ms. alice decides she's going to build a system where she keeps all of her objects in the second type of memory, and then also keeps copies of some of those objects in the first type so that she can do some of her reads more quickly. alice has 2048 objects, all of the same size, which use up all of her second type of memory storage. alice decides to analyze different ways to pick and choose what she keeps in her type a memory, and how they affect her expected object read performance. round all answers to 3 decimal places. if alice is naive and decides to randomly fill her type a memory with objects and never change it, what is her expected time to read 10 randomly selected objects out of the 2048 (in ms)? alice now runs a workload where she reads 20 objects per minute. 50% of the objects she reads are objects she's seen in the past 30 seconds, and the other 50% of the objects are randomly chosen from the full 2048. using the same naive strategy as before, what is her expected average read time for an object with this workload? alice tries to improve her performance. she decides that every time she reads an object, if it is not in her type a memory, she will put it there. when she needs to remove something, she will remove the thing that she read least recently what is alice's average read time per object in the best case scenario? what is alice's average read time per object in the worst case scenario?