C# Algorithm for combining a collection of Tasks

In the manufacture or process industry we often have to deal with operations (or tasks) that have a certain duration. The duration represents the time it takes to produce or consume a certain amount of product (i.e. quantity) In this project we are only after an algorithm which will combine (or collapse) a collection of tasks that have date ranges that overlap. In other words tasks that overlap in time may have to be spliced, so that their overlapping parts are combined and their respective rates added up. ## Deliverables Please see the attached diagram for a simple example. I have also attached two C# projects. One is a library, and the other is a test project with unit tests. Your task is to write the algorithm for the Combine() method in the [login to view URL] file and pass the 6 tests that currently fail in the [login to view URL] file. NOTE: I also have 2 other test that I have not added to the test file yet. If your implementation is robust it will have no problems passing these blind tests. For the project to be completed successfully all test need to pass. You will need to be familiar with TDD. Please let us know if you have experience with scheduling and operations research. Thanks.