Easiest Approach for beginners.
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:  O(n sqrt(n))\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    \n     bool checkPrime(int a){\n        int b=sqrt(a);\n        int c=2;\n        while(c<=b){\n        if(a%c==0) return false;\n        c++;\n        }\n        return true;\n}\n    vector<vector<int>> findPrimePairs(int n) {\n        vector<vector<int>>res;\n        for(int i=2;i<=n/2;i++){\n            int temp=n-i;\n            if(checkPrime(i) && checkPrime(temp)) res.push_back({i,temp});\n        }\n        return res;\n    }\n};\n```
['C++']