Assume that we have an ordered file that stores $180000$ records of relation STUDENT on disk. The block size is $512$ Bytes. The fields of STUDENT Record are$-$ sid $(4$ bytes$),$ sname $(8$ bytes$),$ sbranch $(3$ bytes$),$ saddress $(12$ bytes$),$ sadharID $(5$ bytes$),$ scity $(8$ bytes$).$ The record length is uniform. The primary Key field is sid and also defines the order of records in the file. Any block pointer takes $7$ Bytes. Assume unspanned record organisation.

Do the following.

Design a multilevel index $($with root$-$level$)$ on sid. Now, $($i$)$ give the total number of data blocks needed, $($ii$)$ the number of index blocks in each level, and $($iii$)$ the number of block accesses needed to retrieve a record with the given sid $($worst case$).$

Design a two$-$level index on sadharID. Now, $($i$)$ give the total number of data blocks needed, $($ii$)$ the number of index blocks in each level, and $($iii$)$ the number of block accesses needed to retrieve a record with the given sadharID $($worst case$).$