a. The relation studentid, name, CGPA, street, city, NID) is given. There is a clustering B+ tree index on name attribute of student relation and there are 500 unique names. The height of the index is 4 and there are 10 students whose name is Abdullah. The id is a secondary index and height is 5. The record size is 800 bytes and block size is 2KB. Seek time = 10ms, block transfer time = 0.1ms. Find the query cost for the following queries: i. SELECT * FROM student WHERE name = 'Abdullah' ii. SELECT * FROM student WHERE id = 1912020 b. Describe the algorithm for query a (i)