Store Reservations

You are given a store’s opening time, closing time, and a list of reservations. Each reservation is a pair [start, end] representing the time interval when a customer will occupy the store. Your task is to compute, for every moment between open and close, how many additional customers could be accommodated without exceeding the store’s fixed capacity. Specifically, return a list of disjoint time intervals sorted by start time, each annotated with the number of additional customers that could be seated during that interval.