I need help to write in Scheme or Racket language to solve the todo part. thank you

#lang racket

;; Computing the total area covered by a set of rectangles (Quad-trees and immutable data-structures)

(provide total-rect-area)

; total-rect-area: returns the total integer area covered by any (one or more) rectangles in the given list

; Don't double-count. except this version must be in O(n log n)

; Hint: try implementing an immutable quad-tree to represent 2D space;

(define (total-rect-area rect-list)

'todo)