4. We have a sorted list of 2n+n2 elements. What is the of performing binary search on that list (as a function of n )? Note: You do not need to prove it formally (by the definition); at this point, if you have the running time as an expression, you can take shortcuts keeping the largest term in an expression. Big Theta for binary search on sorted list of size 2n+n2 Show your work here: [ 5pts]