Consider CITIES$($Code$,$ Name, Area, Population, Country$)$ relation containing $10000$ records, where each page of the relation holds $5$ records. Assume that Code attribute takes integer values in the range from $1$ to $10000$; Area and Population attributes take integer values. For each of the following queries, choose one of the below listed indexes that would most likely require the fewest disk accesses for processing the query. $($You don't need to calculate the number of disk accesses made, you should write one of the given index structure that should be used$)$

The indexes that can be used are as follows:

: A lustened Be tse index on attribute Code.

An extendible hash index on attribute Code.

$$ A linear hash index on attribute Name.

$$ A trie index on attribute Name.

$$ A grid file on attributes Name, Area, and Population.

$$ An ISAM index on attribute Population.

$$ An inverted index on attribute Country.

The queries are:

a$)$ Find all cities where Country $="$T$$rkiye$".$ b$)$Find all cities where Code$>20$ AND Code$<100.$ c$)$Find all cities where Pop$$lation $>1500000.$ d$)$Find all cities where Area$<1500$ AND Population $<1000000.$ e$)$Find all cities where Name starts with "Ada".