Q$2$: The NSU student schema is

Student $($id$,$ name, CGPA, street, city, year$-$admit$)$

The SQL is SELECT $*$ FROM student WHERE CGPA$=3$ AND City$=$'Dhaka' AND yearadmit $\backslash (=2020\backslash )$

There are B$+$ tree indices on CGPA, city and year$-$admit. The heights of the indices are $3,3$ and $2$ respectively. The number of tuples $($pointers$)$ for CGPA$=3,$ City$=$'Dhaka' and year$-$admit$=2020\_$are $100,200$ and $1000$ respectively. Considering each tuple in separate block, find the least cost of the SQL using single index. The seek time is $10$ ms and block transfer time is $0\mathrm{.}1$ ms $.$

The result of the intersection of the set of pointers is $20.$ Find the estimated query cost using the intersection of pointers.

The height of the composite index on $($CGPA$,$ City, year$-$admit$)$ is $5.$ The number of pointers satisfying the query is $20.$ Find the estimated query cost using the composite index.