Java code .

The code must be written in Java. The code must follow the same structure of the code in the attachment file "[login to view URL]" the code MUST have no parameters. Please provide any documentations. The output must be the total number of possible toposorts for a set: To test the code you have to get the following answers for these sets: Set input 1: N=7 2,5 3,4 1,3 7,6 3,6 1,2 0,0 ===> to end entering the set The output must = 95 ----------------------------- Set input 2 : n= 6 4,3 5,3 1,2 3,6 5,2 0,0 ===> to end entering the set The output must = 26 ------------------------------------- Set input 3: N=10 2,10 4,8 5,6 6,8 4,2 5,3 7,1 7,6 0,0 The output must = 21780 Please note that the deadline for this project is on 27/01/2015 11:59PM GMT you can download the attachment via this link: [login to view URL]