Please have detailed steps and why. Also, make sure it is VID $>6000.$

Question C$.$File Organization and Indexing

Consider the relation: Vehicle $($VID$,$Maker$,$ Model, Color, Price$),$which contains $6400$records

with each record occupying $50$bytes$.$

VID $($Integer$,4$bytes$)$is the primary key of the relation; the values are between $1$and $6400.$

Maker contains $80$distinct values; the records are evenly distributed among these values.

Color contains $10$distinct values; the records are evenly distributed among these values.

The file is sorted by VID, and stored on a disk with the following configuration:

Block size $=1000$bytes

Block pointer size $=6$bytes

$(1)$What is the total cost $($i$.$e$.,$number of block accesses$)$to retrieve all records with VID $>$

$6000$using primary index? What is the total cost to retrieve these records using binary search?

$(2)$A primary index is built on the VID field. What is the total cost to retrieve all records with

VID $>6000$using the B$+$tree index?$|$

$(3)$A B$+$tree index is built on the VID field, and each tree node is $60\%$full on average. What

is the total cost to retrieve all records with VID $>6000$using the B$^(+)$tree index? How would the total cost change if the file is not sorted by VID?

$(4)$A bitmap index is built on both Maker and Color fields. How many blocks are required to

store the bitmap index $($Note: $1$byte $=8$bits; each bitmap is stored as a fixed$-$length record$)?$

Assume there are $40$records with Maker $=\text{'}$Toyota$\text{'}$ and Color $=\text{'}$Black$\text{'}.$ What is the total

cost to retrieve these records using the bitmap index?