Select an NP complete or NP Hard problem

$.$ Create a program that solves an instance of the problem via

the brute force method and via a faster algorithm $($your choice$).$ Increase the size of

your input $($N$)$

incrementally and track the execution time for each of the runs. Plot the execution times. Use your

discretion on what sizes of N demonstrate the exponential nature of your algorithms.

Approved programming languages: Python

Hand

$-$

in:

The code used to complete the task

$($no zip files$)$

The execution times for each of the incremental runs for both algorithms. $($Command line

output and a plot$)$