select $*$ from weather where city $=$ "Edmonton" and temp $<-30$

Suppose B$+-$tree indexes are constructed on columns city and temp. Data entries are stored in both indexes as $($key$,$rid,pid$)$ where rid is the record id of a data record with key value k and pid is the address of a page where the record with id rid is stored. Further assume $1\%$ of the tuples satisfy the predicate "city$=$'Edmonton'", $1\%$ of the tuples satisfy the predicate "temp$<-30"$ and $0\mathrm{.}01\%$ of the tuples satisfy both predicates.

a$)$ What would be an efficient algorithm to evaluate the query if we know that the index on city is clustered?

b$)$ What would be an efficient algorithm to evaluate the query if we know that none of the indexes are clustered?

c$)$ Suppose each page of the index $($leaf and non$-$leaf$)$ stores up to $200$ keys, and each data page stores up to $100$ records. Assume both index and data pages are full. If N denotes the number of data records, estimate the number of page accesses for both algorithms given in $($a$)$ and $($b$).$