Please accomplish these problems in JavaScript with HTML.

Given an array A of n elements. Find three elements i, j and k in the array such that A[I]^2 + A[j]^2 = A[k]^2. Hints: Use Heapsort(A, n) For each array index i compute A[i]2 and store in array 3. Search for two numbers in array from 0 to i-1 which adds to A[i].

Given an array A of n elements. Find three elements i,j and k in the array such that Al?+A -Ak Hints: 1. Use Heapsort(A, n) 2. For each array index i compute Ali and store in array 3. Search for two numbers in array from O to i-1 which adds to Al[i]