Please help!!!!

We have declared a method called computePrimes with one int parameter num. TASK: Fill in the body of the computePrimes method such that it will return an ArrayList containing the prime numbers less than or equal to num. You may assume that num is greater than 1. HINT: Recall that a number is considered "prime" if it is only divisible by 1 and itself. HINT: 1 is not a prime number. HINT: You can use Math.sqrt(x) to take the square root of a variable x. No need to import anything: we've done that for you behind-the- scenes. It is possible to solve this problem without using the sqrt method, but it will allow you to test if a number is prime much more efficiently. Sample Input: 10 Sample Output: 2 3 5 7