Find the optimal alignment using dynamic programming (by hand) of ATGCC and TACGCA. Use the Needleman-Wunsch cost function that you will use for the project, namely: C_indei = 5; C_sub = 1; and C_match = -3. Show your DP table. Circle the optimal alignment cost. Extract the optimal alignment(s) from the table (keep back-pointers in the table if you want). Find the optimal alignment using dynamic programming (by hand) of ATGCC and TACGCA. Use the Needleman-Wunsch cost function that you will use for the project, namely: C_indei = 5; C_sub = 1; and C_match = -3. Show your DP table. Circle the optimal alignment cost. Extract the optimal alignment(s) from the table (keep back-pointers in the table if you want)