Draw a binary tree that you could use to store the list O, P, Q, R, S, T, U, V, W, X, Y, Z (12 characters ) for future searching, If U is the root and the two children (sibling) are R and X NOTE: Tree should have at most 4 levels ( root at level 0, R X at level 1 etc. HINT Section 8.4 Q & E #1 and constructing a search tree and the tree insertion document in the lesson.

Acomputer has a two-level cache. suppose that 60% of the memory references hit on the first level cache, 35% hit on the second level, and 5% miss. the access times are 5 nsec, 15 nsec, and 60 nsec, respectively, where the times for the level 2 cache and memory start counting at the moment it is known that they are needed (e. g., a level 2 cache access does not even start until the level 1 cache miss occurs). what is the average access time?