Need to create public ArrayList commonPopularWords$($int n$,$ WordFisher other$)$ and test it$.$ This method receives an integer n and another WordFisher obj $($i$.$e$.$ another text$)$ as input & returns an ArrayList of the common popular words $($taken from the n most popular from the first text, n most popular from the other$)$ between the two texts. An empty list should be returned if there are no common words. Given the following JAVA codes.

import java.io$.$BufferedReader;

import java.io$.$FileReader;

import java.io$.$IOException;

import java.nio.file.Files;

import java.nio.file.Paths;

import java.util.ArrayList;

import java.util.HashMap;

import java.util.List;

import java.util.Set;

$/*$ The WordFisher class analyzes word freq in a text file, allowing for

$*$ operations such as pruning stopwords & finding common pop words. $*/$

public class WordFisher $\{$

$/*$ A map containing words as keys & their occurrence freq as values $*/$

public HashMap vocabulary;

$/*$ A list of stopwords to exclude from word freq analysis $*/$

public List stopwords;

private String inputTextFile;

private String stopwordsFile;

$/*$Constructs a WordFisher object & initializes its state$*/$

WordFisher$($String inputTextFile, String stopwordsFile$)\{$

this.inputTextFile $=$ inputTextFile;

this.stopwordsFile $=$ stopwordsFile;

buildVocabulary$()$;

getStopwords$()$;

$\}$

$/*$Reads stopwords from the specified stopwords file & stores them in the stopwords list$*/$

public void getStopwords$()\{$

stopwords $=$ new ArrayList$()$;

String word;

try $\{$

BufferedReader input $=$ new BufferedReader$($new FileReader$($stopwordsFile$))$;

while $(($word $=$ input.readLine$())!=$ null$)\{$

stopwords.add$($word$)$;

$\}$

$\}$ catch $($IOException e$)\{$

e$.$printStackTrace$()$;

$\}$

$\}$

$/*$ Builds the voc by reading words from the input text file &

$*$ counting their freq $*/$

public void buildVocabulary$()\{$

vocabulary $=$ new HashMap$()$;

try $\{$

String reader $=$ new String$($Files$.$readAllBytes$($Paths$.$get$($inputTextFile$)))$;

String$[]$ allWords $=$ reader.toLowerCase$().$replaceAll$("[^$a$-$zA$-$Z$0-9]","").$split$("\backslash \backslash$s$+")$;

int i $=0$;

int length $=$ allWords.length;

int voc$\_$value;

for $($i$=0$; i $<$ length; i$++)\{$

if $($vocabulary$.$containsKey$($allWords$[$i$]))\{$

voc$\_$value $=$ vocabulary.get$($allWords$[$i$])$;

voc$\_$value $=$ voc$\_$value $+1$;

vocabulary.put$($allWords$[$i$],$ voc$\_$value$)$;

$\}$ else $\{$

vocabulary.put$($allWords$[$i$],1)$;

$\}$

$\}$

$\}$ catch $($IOException e$)\{$

e$.$printStackTrace$()$;

$\}$

$\}$

$/*$ Ret the tot # of words in the input file $*/$

public int getWordCount$()\{$

int word$\_$count $=0$;

Object $[]$ word $=$ vocabulary.values$().$toArray$()$;

for $($int i $=0$; i $<$ word.length; i$++)\{$

word$\_$count $=$ word$\_$count $+($Integer$)$ word$[$i$]$;

$\}$

return word$\_$count;

$\}$

$/*$ Ret the # of uni words $*/$

public int getNumUniqueWords$()\{$

int uni$\_$count $=0$;

Object$[]$ key$\_$set $=$ vocabulary.keySet$().$toArray$()$;

for $($int i $=0$; i $<$ key$\_$set.length; i$++)\{$

String word$\_$key $=($String$)$ key$\_$set$[$i$]$;

uni$\_$count $=$ unique$\_$count $+1$;

$\}$

return uni$\_$count;

$\}$

$/*$ Ret the freq of a specific word $*/$

public int getFrequency$($String word$)\{$

if $($vocabulary$.$containsKey$($word$))\{$

return vocabulary.get$($word$)$;

$\}$

return $-1$;

$\}$

$/*$ Removes all stopwords $*/$

public void pruneVocabulary$()\{$

getStopwords$()$;

for $($int j $=0$; j $<$ stopwords.size$()$; j$++)\{$

if $($vocabulary$.$containsKey$($stopwords$.$get$($j$)))\{$

vocabulary.remove$($stopwords$.$get$($j$))$;

$\}$

$\}$

$\}$

$/*$Finds com pop words between this WordFisher instance & another$*/$

public ArrayList commonPopularWords$($int n$,$ WordFisher other$)\{$

ArrayList comPopWords $=$ new ArrayList$()$;

$//$ TODO

return comPopWords;

$\}$

$\}$