Complete the calculate$\_$best$\_$partition function to find the resolution associated with

the partition that generates the highest NMI.

Additionally, complete the plot$\_$best$\_$partition function to visualize the network with

both the ground truth community assignments and the best partition assignments. Plot

both networks side by side as subplots within a single figure. Make sure to label which

graph is which $($louvain vs ground truth$).$

def calculate$\_$best$\_$partition$($G: nx$.$Graph, resolutions: List$[$int$],$ nmis: List$[$float$])->$ Tuple$[$int$,$ List$[$str$]]$:

$"""$

Inputs:

G: NetworkX graph object

resolutions : a list of integer

nmis :a list of float

Returns:

Tuple of resolution and partition

$"""$

return resolution, partition

def plot$\_$best$\_$partition$($G: nx$.$Graph, partition: List$[$str$],$ save: bool$=$False$)->$ None:

$"""$

Inputs:

G: NetworkX graph object

partition : List$[$str$]$

save: boolean

Returns:

None

$"""$

if save:

plt$.$savefig$(\text{'}1\_2\_2.$png$\text{'})$

plt$.$show$()$