Implement `closed_interval_overlap(intervals, query_points)`. Each interval `[start, end]` is closed, so it contains both endpoints. Return `[[maximum_overlap], query_counts]`, a uniform list of integer lists. `maximum_overlap` is the largest number of intervals covering any point and `query_counts[i]` is the number covering `query_points[i]`. ### Constraints - `0 <= len(intervals), len(query_points) <= 200000` - `-10^9 <= start <= end <= 10^9` - Intervals and query points may be unsorted and may contain duplicates. - Return `0` as the maximum for an empty interval list. ### Example For `intervals = [[1,3], [3,5], [3,3]]` and `query_points = [0,3,4]`, return `[[3], [0,3,1]]` because all three closed intervals include point `3`. ```hint Probe equality cases Test a zero-length interval and queries placed exactly at both endpoints of another interval. ``` ```hint Keep duplicates visible Repeated intervals and repeated query points still contribute independently under the stated contract. ```