One question at a time:
To answer your first question: $c_1, c_2, c_4, c_5$ etc. are all costs. You can also look at them as constant time, or $O(1)$ operations. In practice, the value of these costs themselves get absorbed with really big $n$ and are not considered when calculating asymptotic runtime. So for instance, when calculating the total runtime, we eventually upper bound all constants into a single constant, say $C$. But $c_1, c_2, c_4$, etc. are there to help you understand the process of how the algorithm actually works. The more important part is how many times each step occurs. The constant is there to tell you that each operation takes place in constant time, and is obviously not dependent on the input size (meaning it doesn't have any $n$ associated with it). Now every line has some number of operations - that's given by a function of $n$ in the right column. Your total runtime is just the sum of the runtimes of each step $i$, which in turn is some constant, $c_i$ multiplied by the number of times the operation is repeated. I hope that helped give you some clarity about how runtime actually works.
Now regarding your second question: Note carefully that the array goes from 2 to $n$. So number of iterations is $n-2+1=n-1.$
I think you're a bit confused about what contributes to the total runtime: Remember that line can be executed how many ever times, but its contribution to the total runtime is just its cost times the number of times it occurs. As it's commented, the cost is 0 so it does not contribute to the total runtime.