Explain the algorithmic process of converting a standard Control Flow Graph (CFG) into Static Single Assignment (SSA) form. Focus on the concept of dominance frontiers and the placement of phi-functions. Provide a step-by-step transformation of a sample snippet of code containing loops and conditional branches into SSA form. Discuss how SSA form facilitates subsequent compiler optimizations such as constant propagation and dead code elimination.