List of people: Anne (A), David (D), Heather (H), Isabelle (I), John (J), Kara (K),
Matt (M), Natalia (N), Peter (P), and Rob (R).
Context 1:
John knows Matt
Anne knows Kara
Heather knows Natalia
Anne knows Isabelle
Peter knows Isabelle
John knows Kara
Anne knows David
Rob knows Matt
John knows Natalia
David knows Kara
Context 2:
Matt knows David
Peter knows Isabelle
Anne knows Heather
Peter knows Natalia
John knows Natalia
Matt knows Isabelle
Peter knows Rob
Kara knows David
Matt knows Heather
Rob knows Isabelle
Context 3:
Anne knows Peter
John knows Heather
Matt knows Heather
David knows Anne
David knows Natalia
Isabelle knows Rob
Kara knows Natalia
David knows Rob
John knows Natalia
John knows Kara
Context 4:
Peter knows John
Matt knows Anne
David knows Anne
Rob knows Peter
Rob knows Heather
Rob knows Kara
Matt knows Heather
Matt knows Isabelle
Natalia knows Kara
Isabelle knows Heather
QUESTIONS
Question 1:
Build the acquaintance network using:

• the first letter of each person name (e.g. “A” for “Anne”);
• the specific aforementioned context (i.e. 1, 2, 3, or 4) that has been
  assigned to you (see document entitled:
  “YourContextNumberForAssignment2” on Brightspace);
• it is assumed that if “A knows B” then “B knows A”.
  Question 2:
  Give the degree for each node of the network.
  Question 3:
  Build the degree distribution of your acquaintance network.
  Question 4:
  Give the length of the shortest path between:
• Anne and Peter
• Heather and John
• Matt and Natalia
• David and Isabelle
• Kara and Rob
  REMINDER: Length of the shortest path
  The length of the shortest path in a network from one node to another node is the
  minimal number of links you need to connect these two nodes.
  For example, let’s assume:
  A knows B
  A knowns C
  A knows D
  C knows E
  Then:
  The length of the shortest path between A and E is 2 (i.e. path A—C—E).
  The length of the shortest path between B and E is 3 (B—A—C—E).