Find the cost function of the following algorithm and express the upper bound of the time complexity in asymptotic notation. $(20$ marks$)2.$ a$.$ sum$-0$; for i$-0$ to n do $-2$ do for j$-0$ to j if j mod i $0$ then sum$-$sum$+1$;