<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def collect(self, file_paths):
 """ Takes in a list of string file_paths, and parses through them using the converter, strategies, and switches defined at object initialization. It returns two dictionaries- the first maps from file_path strings to inner dictionaries, and those inner dictionaries map from AnchorHub tag to converted anchors. The second dictionary maps file_paths to lists. Each entry on the list corresponds to a duplicate tag found in the file. The entries are lists with the following information: [tag, line_number, previous-anchor-used] :param file_paths: :return: Two dictionaries. The first maps string file paths to dictionaries. These inner dictionaries map AnchorHub tags to generated anchors. The second dictionary maps file paths to lists containing information about duplicate tags found on each page. """

        for file_path in file_paths:
            self._anchors[file_path], d = self.collect_single_file(file_path)
            if len(d) > 0:
                # There were duplicates found in the file
                self._duplicate_tags[file_path] = d
            self._reset_switches()
        return self._anchors, self._duplicate_tags