Suppose a Raft cluster has five nodes: A$,$ B$,$ C$,$ D$,$ and E$.$ The leader of the cluster is node A$,$ and the current term is $3.$ The log entries of each node are as follows: $[30]$

Node A: $[1,2,3,4,5,6]$

Node B: $[1,2,3,4,5,6]$

Node C: $[1,2,3,4,5]$

Node D: $[1,2,3,4,5]$

Node E: $[1,2,3,4,5,6,7]$

Assume that a new entry with the value $"8"$ needs to be added to the log$.$ Walk through the steps of the Raft algorithm, assuming that node A is the leader, to ensure that the new entry is replicated across all nodes in the cluster. Show the resulting log entries of each node after the replication is complete.