Given a list of non-overlapping `intervals` sorted by start, and a `new_interval`, insert it and merge any overlaps. Return the resulting sorted list of non-overlapping intervals.