You are given a \( n \times n \) matrix where all rows are sorted and all columns are sorted. Design a linear time algorithm to find the \( k^{th} \) largest element of the matrix.
