Question $6(20$ points, Concurrent search$)$:Search is a vital operation which may be performed in various ways. We saw in the lecturehow to do exhaustive search by scanning the whole list from start to end until we either findthe item or we report $$item missing$.$ Instead of moving from start to end of a list here wewill check from both sides of the list and move towards the middle until we either find theitem or report $$item missing$($a$)(5$ Pts$.)$ Write pseudocode for the algorithm of the search process described above.$($b$)(5$ Pts$.)$ Check whether the algorithm is loop$-$invariant.$($c$)(10$ Pts$.)$ Compare the computational complexity of both algorithms, the classicallinear search and the two ends search described here.