Algorithms:

Kindly, no handwriting please, and thanks a lot:

Problem 1. a) Show that if f(n) is (g(n)) and d(n) is O(h(n)), then f(n) x d(n) is (g(n) x h(n)). b) Show that 3(n + 1)5 + 2n log n is O(n"). c) Algorithm A executes 10n2 logn operations, while algorithm B executes n3 operations. Determine the minimum integer value no such that A executes fewer operations than B for n no