 Remember to use <a>**`Read-Search-Ask`**</a> if you get stuck. Try to pair program  and write your own code 
###  Problem Explanation:
* You will get a DNA strand sequence and you need to get the pair and return it as a 2D array of the base pairs. Keep in mind that the provided strand should be first always.
* Another way to interpret the problem: there are four potential characters that exist in DNA: "A", "T", "G", and "C". "A" and "T" are always paired together, and "G" and "C" are always paired together.
This problem presents you with an input, e.g. "ATCGA". Each of those five characters are missing their pairs.
E.g. the first character "A" needs to be paired with "T" to give the array element ["A", "T"].
The second character "T" needs to be paired with "A" to give the array element ["T", "A"].
The number of elements in the final output equals the number of characters in the input.
This problem does not involve rearranging the input into different combinations or permutations.
* The program is very simple, the best solution that I have come up with is to use a switch to catch all the possible four elements. Using if statements would take too much code. You could also use Regular Expressions.
* Since we have to the original and the pair, I decided to take all four cases instead of the base two.
* Create an empty array and use the `search` function to push the right values to the array and return them.
##  NOTES FOR CONTRIBUTIONS:
*  **DO NOT** add solutions that are similar to any existing solutions. If you think it is **_similar but better_**, then try to merge (or replace) the existing similar solution.
* Add an explanation of your solution.
* Categorize the solution in one of the following categories — **Basic**, **Intermediate** and **Advanced**. 