1. create space for 1,000 speeding tickets   (cf. Lecture Week 1)
2. create a dynamic m×n-matrix of floating point numbers, given m and n   (ensure elements can be accessed via matrix[i][j])

How many bytes need to be reserved in each case?