Specify adjacency and prove pure privacy at epsilon 1

Specify adjacency and prove pure privacy at epsilon 1

Define the dataset domain, the adjacency relation for a counting query, and the noise distribution. Prove from the definition that the mechanism satisfies pure differential privacy at epsilon = 1. Deliverable: A written proof with the sensitivity argument and the noise parameter, stated so the implementation can be compared against it line by line.