$4.$ You are given an unsorted list $\backslash (\backslash$mathrm$\{$L$1\}\backslash )$ containing $\backslash (\backslash$sim $1\backslash )$ million $(\backslash (\backslash$mathrm$\{$N$\}=2^\{\backslash$wedge$\}20\backslash ))$ names, and a second unsorted list $\backslash (\backslash$mathrm$\{$L$2\}\backslash )$ containing $\backslash (\backslash$sim $1\backslash )$ thousand names $(\backslash (\backslash$mathrm$\{$M$\}=2^\{\backslash$wedge$\}10\backslash )).$ Your task is to determine how many of the names in L $2$ are found in L$1.$ You decide to first sort L$1$ using the quick sort algorithm. Then, for each name in L$2,$ you perform a search in L$1$ using the binary search algorithm. Using big$-$O notation, what is the run$-$time complexity of performing the entire task?

$5.$ Write two lines of code that deletes the third element from the linked list below and returns the value of the deleted element.