In this week exercises you will play with the two probabilistic data structures you have seen in the lecture. The bloom filter and the CountMin Sketch. First, you will implement a simple heavy hitter detector using a bloom filter. After, you will use a count min sketch to count packets for different flows and compare its accuracy depending on memory allocation.