Question 1: Implement a simple HashMap/Dict (note: there are different ways to implement hashmap, you can choose any) and implement the GET function which is expected to return a List for a given userID.

// Then write a function called getFoF (get friends of friends from a given user) to find all candidates the given user can add as friends.

// * You may want to define a data structure to return candidate id & mutual friend count (for example 1 and 5 have 2 mutual friends) which information would be used in 2nd question.

// For example

// 2---4
// /
// 1
// \
// 3---5---6

// getFoF(1) --> [(5,2), (4, 1)]
// getFoF(5) --> [(1,2), (4, 1)]