Must be in C++ Code. Please have a separate .cpp and .h section for the code. Also PLEASE MAKE SURE IT WORKS CORRECTLY!

8. Two Sum (This is a very classic problem): Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Given nums = 12, 7, 11, 15], target-9, Because nums[0]+ nums[1] 2+7 9, return [0, 1]. Please implement your solution with given class class Solution public: vectorcint> twoSum_1(vectorcint>& nums, int target) //your implementation for (1) here / vectorkint> twoSum_2(vector&nums, int target) //your implementation for (2) here ) (1). Use only for loops without hash table to solve this problem. (5') (2). Use hash table to solve this problem. (hint: you can use unordered_map to create hash table in cpp) (10')