Leetcode 3537. Fill a Special Grid

Construct a 2^n x 2^n permutation of integers 0..2^(2n)-1 so that the four quadrants (top-right, bottom-right, bottom-left, top-left) have strictly increasing value ranges (top-right < bottom-right < bottom-left < top-left) and each quadrant itself is recursively a special grid; return any grid satisfying this for n ≤ 10.