Please dont just copy whats already on chegg, its wrong. The instructions ask for a proof not an overview on M-Trees...

3. Please read the lecture slide of Chapter 5 , "Range Queries Over M-Tree", and prove the pruning strategy for the range query below (Hint: use the triangle inequality) [30 points]: If d(Op,Q)d(Or,Op)>r(Q)+r(Or), then d(Or,Q)>r(Q)+r(Or) holds and node centered at Or with radius r(Or) can be safely pruned