Implement binary search Hint What's this? Atport a prosive (If you don't know JavaScript, you can skip the code challenges, or you can do the Intro to JS course and come back to them.) war doSearch = function(array, targetValue) \{ var min=; vor max = orray. length 1; var guess; Complete the dosearch function so that it implements a binary search, following the ahile (.)in pscudo-code below (this pseudo-code was described in the previous article): 1. Let min=0 and nax =n1. 2. If max 1. 3. Compute guess as the average of max and min, rounded down (so that it is an integer). 4. If array [ guess ] equals target, then stop. You found it Return quess. 5. If the guess was too low, that is, array [ guess ]