Given * An array X of N integers. Required * Find pair of items with highest increase? i.e., a pair of items (X[a], X[b]) with a < b, X[a] < X[b] and NAME_1 difference X[b] – X[a]? Complexity (Worst Case) of Greedy Solution (if any)?
 A. Log(N)
 B. No SAFE Greedy Choice
 C. 2^N
 D. N!
 E. N
 F. N Log(N)
 G. N^2 Your answer should have exactly 5 paragraphs. Make sure that the first paragraph starts with the word "guarantee" and that each paragraph is separated by two new lines.
user