Derive the querying time complexity of range query in a d-dimensional KD-tree. Write down the recursion you will have for the maximum number of intersections with the query region in terms of both n and d, and the final complexity. You must provide the detailed derivation in addition to writing down the expressions.