2. Use the following schema and query plan to answer the corresponding questions R (a,b,c) B(R)= 1000 T(R) = 10,000 Min (R,a) 01 Max (R,a) = 9000 V(R,b)= 100 V(R,c) : = b. Compute the cost of this query plan in terms of number of pages read from disk or written to disk. Assume that the B+ tree indexes on single columns cost 2.4 reads/lookup, the indexes on multiple columns cost 4 reads/lookup, and the buffer pool of the system can hold up to 252 frames (5 points)