GATE Computer Science (CS) 2011 Solved Paper

Consider a relational table r with sufficient number of records, having attributes A₁, A₂,..., A_n and let 1 ≤ p ≤ n. Two queries Q1 and Q2 are given below.
$\mathit{Q}1:{\mathit{\pi }}_{{\mathit{A}}_{\mathit{i}}...{\mathit{A}}_{\mathit{p}}}\left({\mathit{\sigma }}_{{\mathit{A}}_{\mathit{p}}=\mathit{c}\left(\mathit{r}\right)}\right)$ where c is a constant
$\mathit{Q}2:{\mathit{\pi }}_{{\mathit{A}}_{\mathit{i}}...{\mathit{A}}_{\mathit{p}}}\left({\mathit{\sigma }}_{{\mathit{c}}_1\le {\mathit{A}}_{\mathit{p}}\le {\mathit{c}}_2}\left(\mathit{r}\right)\right)$ where c1 and c₂ are constant
The database can be configured to do ordered indexing on A_p or hashing on A_p. Which of the following statements is TRUE?