give solution and explain

function/(n) that grows as slowly as possible. 5 (20 pt) Suppose that you run the program, below (brute-force solution to the 4-sum problem) for N = 1,000 and observe that it takes 1,000 seconds. int brute int al], int N) int i, j, k, m for -0;i<>