Estimate the worst case time complexity in terms of n for thefollowing:
match : = 0
for i := 1 to n-1 do
for j := i+1 to n do
if s[i] == S[[j]-1 then
match :=match+1
else
if s[j] ==S[k] then
match := match+1
end if
end if
end for
end for
Expert Answer
An answer will be send to you shortly. . . . .