Please fill in the two function to solve this problem?

The Problem: Matching Group Schedules

The group schedule matching problem takes two or more arrays as input. The arrays

represent availabilities and daily working periods of group members. It outputs an array

containing intervals of time when all members are available for a meeting.

Let us assume there are at least two persons in your class project group. You want to

schedule a meeting with another group member. The members decide to provide you with

$($a$)$ a schedule of their 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.

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 military format. For example: $9$:$30,$

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

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

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

Here is the code:

import sys

def groupschedule $($pers$1$Schedule, pers$1$DailyAct, pers$2$Schedule, pers$2$DailyAct,duration $)$:

updatedSchedule$1=$ updateSchedule$($pers$1$Schedule, pers$1$DailyAct$)$

updatedSchedule$2=$ updateSchedule$($pers$2$Schedule, pers$2$DailyAct$)$

mergedSchedule$=$mergedSchedules$($updatedSchedule$1,$ updatedSchedule$2)$

sortedSchedules$=$ sortedAllSchedules$($mergedSchedule$)$

print $($ matchedAvailabilities$($sortedSchedules$,$duration$))$

def updateSchedule$($Schedule$,$ DailyAct$)$:

updatedSchedule $=$ Schedule$[$:$]$ #make a copy of the schedule

updatedSchedule $=$list$()$

updatedSchedule.insert$(0,[\text{'}0$:$00\text{'},$ DailyAct$[0]])$ #update unavailable schedules and add early morning hours

updatedSchedule.append$([$DailyAct$[1],\text{'}23$:$59\text{'}])$ #update unavailable schedules and add after work hours

return updatedSchedule

#return list$($map$($lambda s: $[$convertToMinutes$($s$[0]),$ convertToMinutes$($s$[1])],$ updatedSchedule$))$

def mergedSchedules$($pers$1$Schedule, pers$2$Schedule$)$:

merged $=[]$

i$,$j $=0,0$

while i $$ len$($pers$1$Schedule$)$ and j$$ len$($pers$2$Schedule$)$:

meeting$1,$ meeting$2=$pers$1$Schedule$[$i$],$ pers$2$Schedule$[$j$]$

if meeting meeting$2[0]$:

merged.append$($meeting$1)$

i$+=1$

else:

merged.append$($meeting$2)$

j$+=1$

while i$$ len$($pers$1$Schedule$)$:

merged.append$($meeting$1)$

i$+=1$

while i$$ len$($pers$2$Schedule$)$:

merged.append$($meeting$2)$

j$+=1$

return merged

def sortedAllSchedules $($Schedule$)$:

allSchedules $=[$Schedule$[0][$:$]]$

$********$#Todo: write a function to arrange all schedules. New meeting starts AFTER the end of current meeting.$******$

def matchedAvailabilities$($Schedule$,$ duration$)$:

availabilities$=[]$

$********$#Todo: write a function to match all availabilities$********$

def convertToMinutes$($time$)$:

hours, minutes $=$ list$($map$($int$,$ time.split$("$:$")))$

return hours $*60+$ minutes

def convertMinutestoHour$($minutes$)$:

hours $=$ minutes $//60$

mins $=$ minutes$\%60$

toString $=$ str$($hours$)$

toStringMins $="0"+$ str$($mins$)$ if mins$<mtext></mtext><mn>1</mn><mn>0</mn>$ else str$($mins$)$

return toString $+"$:$"+$ toStringMins

def main$()$:

pers$1$Schedule $=$ input$("$Enter schedule for person $1$:$")$

pers$2$Schedule $=$ input$("$Enter schedule for person $2$:$")$

pers$1$DailyAct $=$ input$("$Enter Daily Availability for pers $1$: $")$

pers$2$DailyAct $=$ input$("$Enter Daily Availability for pers $2$: $")$

duration $=$ input$("$Enter duration of the proposed meeting: $")$

groupSchedule$1=$ groupschedule $($pers$1$Schedule, pers$1$DailyAct, pers$2$Schedule, pers$2$DailyAct,duration $)$

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

main$()$