For all algorithms give the analysis for the worst-case time bound. Read the problem statements carefully. You cannot use hashing. (i) Given is an array A of size n containing integers in arbitrary order and an integer T. Describe and analyze an efficient algorithm determining whether there exist three entries A[i], A[j], and A[k] with A[i] + A[j] + A[k] lessthanorequalto T, i