$1.$ Use Needleman$-$Wunsch algorithm to align the following two sequences, with BLOSUM$50$ and a linear gap penalty of $-8.$

S$1=$ FDCVI

S$2=$ FHEKVAI

a$.$ Fill out the dynamic programming table

b$..$ Highlight the optimal path

c$.$ Write out the optimal alignment