1 (30 points) Theory questions 1. (5 mark) What is the time complexity of a convolution with an N by N sized kernel when using a direct convolution with a square 2d mask, and when using a separable kernel? Each of the answers is in the form of O(?) where? is an expression in N. If you do not know what big O notation means, it is an expression which is proportional to the running time of a given algorithm. 1 (30 points) Theory questions 1. (5 mark) What is the time complexity of a convolution with an N by N sized kernel when using a direct convolution with a square 2d mask, and when using a separable kernel? Each of the answers is in the form of O(?) where? is an expression in N. If you do not know what big O notation means, it is an expression which is proportional to the running time of a given algorithm