[b](i)[/b] Determine the smallest number of edges which a graph of $ n$ nodes may have given that adding an arbitrary new edge would give rise to a 3-clique (3 nodes joined pairwise by edges).
[b](ii)[/b] Determine the smallest number of edges which a graph of $ n$ nodes may have given that adding an arbitrary new edge would give rise to a 4-clique (4 nodes joined pairwise by edges).
**(i)** Determine the smallest number of edges which a graph of \( n \) nodes may have given that adding an arbitrary new edge would give rise to a 3-clique (3 nodes joined pairwise by edges).

1. **Understanding the Problem:**
   - We need to find the smallest number of edges in a graph with \( n \) vertices such that adding any new edge will create a 3-clique.
   - This means the graph is 3-critical: it does not contain a 3-clique, but adding any edge will create one.

2. **Constructing the Graph:**
   - Consider a complete bipartite graph \( K_{1, n-1} \). This graph has one vertex connected to all other \( n-1 \) vertices, and no edges between the \( n-1 \) vertices.
   - This graph has \( n-1 \) edges.
   - Adding any edge between the \( n-1 \) vertices will create a 3-clique involving the central vertex and the two vertices connected by the new edge.

3. **Verification:**
   - The graph \( K_{1, n-1} \) does not contain any 3-cliques initially.
   - Adding any edge between the \( n-1 \) vertices will create a 3-clique.

Thus, the smallest number of edges in a graph of \( n \) nodes such that adding any new edge creates a 3-clique is \( n-1 \).

**(ii)** Determine the smallest number of edges which a graph of \( n \) nodes may have given that adding an arbitrary new edge would give rise to a 4-clique (4 nodes joined pairwise by edges).

1. **Understanding the Problem:**
   - We need to find the smallest number of edges in a graph with \( n \) vertices such that adding any new edge will create a 4-clique.
   - This means the graph is 4-critical: it does not contain a 4-clique, but adding any edge will create one.

2. **Constructing the Graph:**
   - Consider a complete tripartite graph \( K_{1,1,n-2} \). This graph has two vertices connected to each other and each connected to all other \( n-2 \) vertices, and no edges between the \( n-2 \) vertices.
   - This graph has \( 2(n-2) + 1 = 2n - 3 \) edges.
   - Adding any edge between the \( n-2 \) vertices will create a 4-clique involving the two central vertices and the two vertices connected by the new edge.

3. **Verification:**
   - The graph \( K_{1,1,n-2} \) does not contain any 4-cliques initially.
   - Adding any edge between the \( n-2 \) vertices will create a 4-clique.

Thus, the smallest number of edges in a graph of \( n \) nodes such that adding any new edge creates a 4-clique is \( 2n - 3 \).

The final answer is \( \boxed{ n-1 } \) for part (i) and \( 2n - 3 \) for part (ii).