Memoryless Message Relay Chain

A message must traverse a chain of relay nodes to reach its destination. Each node independently takes $\operatorname{Geom}(1/3)$ attempts to successfully forward the message to the next node. However, on each attempt, there is an independent probability $1/5$ that the node permanently fails, destroying the message. If the node fails, the message is lost. If the chain has 2 nodes, find:

(i) The probability the message reaches the destination (traverses both nodes).

(ii) The expected total number of attempts across both nodes, given the message reaches the destination.