Q1. THE FIRST ATTENDANCE QUESTION WAS:
What is Euler's 7 bridges problem

A1. MY ANSWER TO THE FIRST ATTENDANCE QUESTION IS:
The city of Königsberg in Prussia was set on both sides of the Pregel River, and included two large islands—Kneiphof and Lomse—which were connected to each other, or to the two mainland portions of the city, by seven bridges. The problem was to devise a walk through the city that would cross each of those bridges once and only once.


Q2. THE  SECOND ATTENDANCE QUESTION WAS:
Draw the graph 

A2. MY ANSWER TO THE  SECOND ATTENDANCE QUESTION IS:



Q3. THE  THIRD ATTENDANCE QUESTION WAS:
What is prob of getting 1000 times of each number

A3. MY ANSWER TO THE  THIRD ATTENDANCE QUESTION IS:
6000!/6^6000


Q4. THE  FOURTH ATTENDANCE QUESTION WAS:
Write the graph in our data structure

A4. MY ANSWER TO THE  FOURTH ATTENDANCE QUESTION IS:
[{11,12,13},[21,22,23],{31,32,33},{41,42,43},{51,52,53}]


Q5. THE  FIFTH ATTENDANCE QUESTION WAS:
Construct the graph and find number of paths

A5. MY ANSWER TO THE  FIFTH ATTENDANCE QUESTION IS:
a. {[1, 3, 1, 3, 2, 6], [1, 3, 1, 3, 5, 6], [1, 3, 1, 5, 3, 6], [1, 3, 2, 3, 2, 6], [1, 3, 2, 3, 5, 6], [1, 3, 2, 4, 2, 6], [1, 3, 2, 4, 3, 6], [1, 3, 2, 4, 5, 6], [1, 3, 2, 6, 2, 6], [1, 3, 2, 6, 3, 6], [1, 3, 2, 6, 5, 6], [1, 3, 4, 2, 3, 6], [1, 3, 4, 3, 2, 6], [1, 3, 4, 3, 5, 6], [1, 3, 4, 5, 3, 6], [1, 3, 5, 1, 3, 6], [1, 3, 5, 1, 5, 6], [1, 3, 5, 3, 2, 6], [1, 3, 5, 3, 5, 6], [1, 3, 5, 4, 2, 6], [1, 3, 5, 4, 3, 6], [1, 3, 5, 4, 5, 6], [1, 3, 5, 6, 2, 6], [1, 3, 5, 6, 3, 6], [1, 3, 5, 6, 5, 6], [1, 3, 6, 2, 3, 6], [1, 3, 6, 3, 2, 6], [1, 3, 6, 3, 5, 6], [1, 3, 6, 5, 3, 6], [1, 5, 1, 3, 2, 6], [1, 5, 1, 3, 5, 6], [1, 5, 1, 5, 3, 6], [1, 5, 3, 1, 3, 6], [1, 5, 3, 1, 5, 6], [1, 5, 3, 2, 3, 6], [1, 5, 3, 4, 2, 6], [1, 5, 3, 4, 3, 6], [1, 5, 3, 4, 5, 6], [1, 5, 3, 5, 3, 6], [1, 5, 3, 6, 2, 6], [1, 5, 3, 6, 3, 6], [1, 5, 3, 6, 5, 6], [1, 5, 4, 2, 3, 6], [1, 5, 4, 3, 2, 6], [1, 5, 4, 3, 5, 6], [1, 5, 4, 5, 3, 6], [1, 5, 6, 2, 3, 6], [1, 5, 6, 3, 2, 6], [1, 5, 6, 3, 5, 6], [1, 5, 6, 5, 3, 6]}
b. 50
c. 50