3. Range Queries Over M-Tree, prove the pruning strategy for the range query below (Hint: use the triangle inequality [30 points]: If d(Op, O)-d(O, Op)Pr+(O), then d(O O> (O) +r(O) holds and node centered at O, with radius (O) can be safely pruned. Or (Or d(Op.Q) dOr.Op) Op op dOrp 3. Range Queries Over M-Tree, prove the pruning strategy for the range query below (Hint: use the triangle inequality [30 points]: If d(Op, O)-d(O, Op)Pr+(O), then d(O O> (O) +r(O) holds and node centered at O, with radius (O) can be safely pruned. Or (Or d(Op.Q) dOr.Op) Op op dOrp