Question 10
(CZS 4) The square $ABCD$ is to be decomposed into $n$ triangles (nonoverlapping) all of whose angles are acute. Find the smallest integer $n$ for which there exists a solution to this problem and construct at least one decomposition for this $n$. Answer whether it is possible to ask additionally that (at least) one of these triangles has a perimeter less than an arbitrarily given positive number.