Question 6-1 Given B+ tree indices on name, and total-credit. The height of the indices are 4 and 2 respectively. SQL: SELECT * FROM student WHERE name='Abdullah AND total-credit = 100 t1 = 0.1ms, ts = 10ms The number of tuples (pointers) name='Abdullah AND total-credit = 100 are 50 and 200 respectively a. Find the least cost of the SQL using A7 algorithm and analyze the result. The indices are secondary index, We have to use A4 algorithm. Query cost = index cost + data cost = h. * (tz +t) +n *(ty+t) b. Analyze the result Question 6-1 Given B+ tree indices on name, and total-credit. The height of the indices are 4 and 2 respectively. SQL: SELECT * FROM student WHERE name='Abdullah AND total-credit = 100 t1 = 0.1ms, ts = 10ms The number of tuples (pointers) name='Abdullah AND total-credit = 100 are 50 and 200 respectively a. Find the least cost of the SQL using A7 algorithm and analyze the result. The indices are secondary index, We have to use A4 algorithm. Query cost = index cost + data cost = h. * (tz +t) +n *(ty+t) b. Analyze the result