IN PYTHON PLEASE!

Thank you in advance!!

In this problem, you will be given an input list. Your job will be finding the top k frequent elements in the input array.

Assume you will be given an integer list and an integer k$,$ return the k most frequent elements in an output array.

For example: if input array is $[1,2,1,3,2,2]$ and k $=2,$ the output will be $[1,2]$; if input array is $[1]$ and k $=1,$ the output will be $[1].$ Please solve this problem in two different ways. For example:

$(1)$ Using a Sorting algorithm $($the implementation is by your choice$)$

$(2)$ Using a Priority Queue $($the implementation is by your choice$)$

Try your best to optimize both of your solutions. Please also write a paragraph for each solution in the comment to analyze the time and space complexity.$(40$ points$)$ In this problem, you will be given an input list. Your job will be finding the top $k$

frequent elements in the input array. Assume you will be given an integer list and an

integer $k,$ return the $k$ most frequent elements in an output array. For example: if input array

is $1,2,1,3,2,2$ and $k=2,$ the output will be $[1,2]$; if input array is $[1]$ and $k=1,$ the output

will be $[1].$ Please solve this problem in two different ways. For example:

$(1)$ Using a Sorting algorithm $($the implementation is by your choice$)$

$(2)$ Using a Priority Queue $($the implementation is by your choice$)$

Try your best to optimize both of your solutions. Please also write a paragraph for each

solution in the comment to analyze the time and space complexity.