Very Easy Solution in java 
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public List<List<Integer>> findPrimePairs(int n) {
        boolean isprime [] = new boolean [n+1];
        Arrays.fill(isprime , true);
        isprime[0] = isprime[1] = false;
        for(int i = 2 ; i*i <= n ; i++){
            if(isprime[i]){
                for(int j = i*i ; j <= n ; j = j+i){
                    isprime[j] = false;
                }
            }
        }
        List<List<Integer>> list = new ArrayList<>();
        for(int i = 2 ; i <= n/2 ; i++){
             if(isprime[i] && isprime[n-i] && i<=n-i){
                ArrayList<Integer> ans = new ArrayList<>();
                ans.add(i);
                ans.add(n-i);
                list.add(ans);

             }
        }
        return list ;
    }
}
```
['Java']