A DNA sequence is represented by a string of lowercase letters. Given a pair of DNA sequences, if the scientist is able to remove any number of a letter in sequence$1$ and any number of a letter in sequence$2$ to make the strings anagrams, then the sequences are similar.

Given n pairs of DNA sequences, for each pair, attempt to find if they are similar. Return a list of boolean values where boolean$[$i$]$ indicates for the i'th pair.

Function Description

Complete the function getSequence in the editor below.

getSequence has the following parameter$($s$)$:

String dna$[$n$][2]$ : the pairs of DNA sequences.

Returns

boolean$[$n$]$ : 'true' if the pair is special, and 'false' otherwise

Example $1$ :

Input: dna $=[["$safddadfs$",$ "famafmss"$]]$

Output: $[$true$]$

Explanation:

The strings are anagrams after removing all the occurrences of character $\text{'}$d$\text{'}$ from s and character $\text{'}$m$\text{'}$ from t$.$ Return $[$True$].$

Note: It is not required that all instances of a character be removed. For example, given 'aab' and $\text{'}$ba$\text{'},$ one $\text{'}$a$\text{'}$ can be removed from 'aab' to leave $\text{'}$ab$\text{'}.$

Example $2$ :

Input: dna $=[["$abcee$",$ "acdeedb"$],["$sljffsajej$",$ "sljsje"$]]$

Output: $[$true$,$ false$]$

Explanation:

For pair $1,$ remove $\text{'}$b$\text{'}$ from the second string and leave the first string untouched.

For pair $2,$ dna$1$ contains $\text{'}$f$\text{'}$ and $\text{'}$a$\text{'}$ which are not in dna$2.$ They cannot be anagrams after removing only a character from dna$1.$

Constraints:

$1<=$ n $<=10$

$1<=$ length of dna$[$i$][0],$ dna$[$i$][1]<=10000.$

The strings in dna$1$ and dna$2$ consist of lowercase English letters only.

Complete the following implementation in Java

import java.util.$*$;

import java.io$.*$;

import java.lang.$*$;

public class Solution $\{$

public boolean$[]$ getSequence$($String$[][]$ dna$)\{$

$\}$

$\}$