Query time of the kd-tree lower bound

5.1 In the proof of the query time of the kd-tree we found the following recurrence: if n=1, Q(n)= 2+2Q(n/4), ifn >1. Prove that this recurrence solves to (n) = O(n). Also show that (vn) is a lower bound for querying in a kd-tree by defining a set of n points and a query rectangle appropriately