a. By suitable multiplication on each row and column, the matrix $A$ can be written as $k \begin{pmatrix} 1 & 1 & 1 \\ 1 & a & b \\ 1 & c & d \end{pmatrix}$, where $a, b, c, d, k$ are complex numbers of absolute value $1$.

The relation $\det(A) = 0$ gives $(a-1)(d-1) = (b-1)(c-1)$. Take the complex conjugates to get $\overline{ad}(a-1)(d-1) = \overline{bc}(b-1)(c-1)$.

If $(a-1)(d-1) = 0$, then $(b-1)(c-1) = 0$ and two rows — or columns — are equal to $(1 \ 1 \ 1)$ and the claim is reached.

Suppose $(a-1)(d-1) = (b-1)(c-1) \neq 0$. Then $\overline{ad} = \overline{bc}$ and $ad = bc$. From $(a-1)(d-1) = (b-1)(c-1)$ we get $a+d = b+c$, hence $\{a,d\} = \{b,c\}$ or $a=b=c=d$. It follows that the bottom two rows or the rightmost two columns are equal, hence the claim.

b. Notice that $A = \begin{pmatrix} 1 & 1 & 1 & 1 \\ 1 & 1 & i & -i \\ 1 & -i & 1 & -i \\ 1 & i & i & -1 \end{pmatrix}$ is a singular matrix and any two rows or columns are not proportional. The above claim fails for $n = 4$.