C$++$ Please

Problem $1$: Ensuring Convenient Schedules

The group schedule matching takes two or more arrays as input. The arrays represent slots that are

already booked and the login$/$logout time of group members. It outputs an array containing

intervals of time when all members are available for a meeting for a minimum duration expected.

Mathematically, the problem can be represented as:

Group Schedule Problem

input: arrays $m$ of related elements comprising the time intervals and an array $d,$ representing

the daily active periods of all members. $U$ is a global set of all arrays. The problem can be

represented as:

$U_{\text{r}\text{s}\text{u}\text{b}\text{e}\text{U}}{\displaystyle \underset{i=1}{\overset{n}{}}}{m}_i$

The group schedule matching takes the following inputs:

Busy$\_$Schedule: An array list that represents the person's existing schedule $($they can't

plan any other engagement during these hours$)$

Hint: Array may be $2$D or maybe a list, ArrayList.

Working$\_$period: Daily working periods of group members. $($earliest time, latest time$)$

Duration of the meeting It outputs a list of list containing intervals of time when all

members are available for a meeting for the minimum duration of the meeting required.

Analogy for the Problem:

Assume there are at least two persons in your class project group. You want to schedule a

meeting with another group member. You are provided with $($a$)$ a schedule of members'

daily activities, containing times of planned engagements. They are not available to have

a meeting you during these periods; $($b$)$ the earliest and latest times at which they are

available for meetings daily. Your schedule and availabilities are provided too.

Sample Input

person$1\_$Schedule $=[[7$:$00,8$:$30],[12$:$00,13$:$00],[16$:$00,18$:$00]]$

person$1\_$DailyAct $=[9$:$00,19$:$00]$

person$2\_$Schedule $=[[9$:$00,10$:$30],[12$:$20,13$:$30],[14$:$00,15$:$00],[16$:$00,17$:$00]]$

person$2\_$DailyAct $=[9$:$00,18$: $30]$

duration$\_$of$\_$meeting $=30$

Sample output

$[[10$:$30,12$:$00],[15$:$00,16$:$00],[18$:$00,18$:$30]]$

Write an algorithm that takes in your schedule, your daily availability $($earliest time, latest time$)$

and that of your group member $($or members$),$ and the duration of the meeting you want to

schedule. Time is given and should be returned in $24$hr military format $($HH:MM$),$ for example:

$9$:$30,22$:$21.$ The given times $($output$)$ should be sorted in ascending order.

An algorithm for solving this problem may involve combing the two sub$-$arrays into an array

containing a set of unavailabilities, with consideration of the daily active periods.