JAVA/C program

The program should take 3 command line arguments:

$ java TableDownloader (link) (link prefix) 0

1. The first link is that starting wikipedias gymnastics page.

This is the first page that it looks for tables.

2. The second is the domain prefix. It should not consider going to any website that does not start with that prefix.

3. The third (1 above) is the total number of links that it is allowed to crawl in a breadth-first manner from the starting page.

A new file should be made for each table. The name of the file should be:

pageName_captionWithoutSpaces.txt

page name is from first link and caption is from html source

For example, the table with caption Common Types of Skills in Tumbling appearing in Gymnastics link should be named Gymnastics_CommonTypesofSkillsinTumbling.txt.

1. The first line of the file should be:
2. "URL","(whatever the link was)"

Both should be wrapped in double-quotes. For example, for the Gymnastics page it is:

"URL","https://www.whatever.com"

3. The second line of the file should be:

"Table","(whatever the table caption was)"

Both should be wrapped in double-quotes. For example, for the Gymnastics page it is:

"Table","Common Types of Skills in Tumbling"

4. The third line should be blank.
5. The fourth line should be:

"Headings","(1st Heading)","(2nd Heading)","(3rd Heading)" (etc.)

where Headings and all headings are wrapped in double-quotes. For example, for the Gymnastics page it is:

"Headings","Skill","Explained"

If there is no row with all headings then do not worry about handling the table.

6. There should be one subsequent line for each table row with only table data (Like this) on it. Each row should begin with

"",

to denote a blank first column. All values should be wrapped in double-quotes. For example, for the Gymnastics page the first data

"","Round-off","A common entry skill seen in every type of gymnastics to turn horizontal speed into vertical speed."

7. After visiting that page, it should consider visiting any linked page if:
   1. that page has not already been visited
   2. that page is not already scheduled been visited
   3. the URL begins with the prefix URL
   4. the number of links to it is less than or equal to the maximum search depth specified on the command line

Doing this will require keeping track of the URL and the number of remaining links in some linear data-structure. This will achieve breadth-first search.