The software is being further developed to store whether the whole party is present or not; party complete being $0$ indicates the party is incomplete $($and so cannot yet be seated$),$ and party complete being $1$ indicates the party is complete, and therefore can be seated when a table becomes available.

The code below implents this as a class. The as$\_$dict method can be used to return a dictionary of the bookings which can be used for testing purposes.

$\%$run $-$i m$269\_$array

$$

class Bookings:

$"""$A dynamic array implementation

to store bookings.

$"""$

def $\_\_$init$\_\_($self$)$:

$"""$Create a new empty array.

$"""$

self.bookings $=$ DynamicArray$(0)$

def add$\_$booking$($self$,$ reservation$\_$ID: int, name: str$,$ table: int$)->$ None:

$"""$Adds a booking to the array.

$"""$

size $=$ self.bookings.length$()$

self.bookings.resize$($size$+1)$

self.bookings.set$\_$item$($size$,($reservation$\_$ID$,$ name, table, $0))$

def get$\_$party$\_$complete$($self$,$ reservation$\_$ID: int$)->$ int:

$"""$Precondition: reservation$\_$ID exists.

$"""$

for index in range$($self$.$bookings.length$())$:

booking $=$ self.bookings.get$\_$item$($index$)$

if booking$[0]==$ reservation$\_$ID:

return booking$[3]$

def as$\_$dict$($self$)->$ None:

$"""$Returns dictionary version

of the bookings array.

$"""$

bookings $=$ dict$()$

for index in range$($self$.$bookings.length$())$:

booking $=$ self.bookings.get$\_$item$($index$)$

bookings$[$booking$[0]]=$ booking$[1],$booking$[2],$booking$[3]$

return bookings

Write a problem definition for a function which returns a tuple with two values: the first being the count of bookings with parties which are incomplete and the second being the count of bookings with parties which are complete.

Write your answer here

Function:

Inputs:

Preconditions:

Output:

Postconditions: