Step 1: Check statement (I). The Gauss-Jacobi method computes every component of a new iterate using only values from the previous iteration, while the Gauss-Seidel method uses the most recently updated components as soon as they are available within the same iteration. Because of this immediate use of updated information, Gauss-Seidel generally converges faster than Gauss-Jacobi for systems where both methods converge, such as diagonally dominant systems. So statement (I) is true.
Step 2: Check statement (II). The Gauss-Jordan method eliminates the unknowns both below and above each pivot, reducing the coefficient matrix all the way to a diagonal matrix (the identity matrix after normalisation), so the solution can be read off directly without back substitution. Reducing a matrix only to upper triangular form, followed by back substitution, is what plain Gaussian elimination does, not Gauss-Jordan elimination. So statement (II) is false.
Step 3: Since (I) is true and (II) is false, only statement (I) holds.
\[\boxed{\text{Only (I)}}\]