6. Find a big-O estimate for the worst-case complexity in terms of the number of assignments fo the algorithm that determines if a function is one-to-one (described in pseudocode below). In thi algorithm, each element in the range is checked to see if it is the image of one or more than one element in the domain. bi, b2,.up, integers, f(x) a function from Ato B) Procedure one to one (q, , For i:-1to m , a, hit(b):-0 Count:-0 For j-1 ton If hit(f (a,)-0 then hit(f(a))-1 Else Return false Return true (fx) is one to one if true is returned, it is not one to one if false is returned)