What is not true about the Needleman$-$Wunsch algorithm?

Question $8$ options:

All values in the partial alignment score table are non$-$negative.

The score of the best alignment is always on the lowest rightmost cell of the partial alignment score table.

It is for global sequence alignment.

Dynamic programming is used to reduce the computation time.