You are given a sorted (ascending) array of response times in milliseconds, a fixed bucket width, and a total number of buckets. Distribute the response times into fixed-width buckets indexed 0 through numBuckets - 1, where bucket i covers the range [i * width, (i + 1) * width - 1]. The last bucket acts as an overflow bucket and captures all values greater than or equal to its lower bound. Return an array of length numBuckets where each element is the count of response times in that bucket.

---

...