Consider the function f defined by
f(n)=n1(⌊1n⌋+⌊2n⌋+⋯+⌊nn⌋)
for all positive integers n. (Here ⌊x⌋ denotes the greatest integer less than or equal to x.) Prove that(a) f(n+1)>f(n) for infinitely many n.(b) f(n+1)<f(n) for infinitely many n. functionfloor functionalgebra unsolvedalgebra