Solve using c$++.$ Design and find the complexity of two algorithms that solve the following problems for

an unsorted array $A,$ holding positive integers:

$(1)$ Find the maximum value of $A[j]+A[i]$ where $j>i$

$(2)$ Find the maximum value of $A[j]-A[i]$ for any $i,j$