Given two sequences, where one is a substring of the other, we define a
substring alignment by matching the substring with the longer sequence and
placing gaps everywhere else. For example if the input is ACCTGTAGG and TGT
then the substring alignment is

ACCTGTAGG 
---TGT---

Write a Python program that prints the substring alignment of two unaligned
sequences in a FASTA file. If no substring alignment exists then the program
should print "No alignment found".

This extra credit assignment will add 2% to your overall class grade. There will
be no partial credit. If the program runs on simple test cases you will get
the full 2 points and otherwise none.

Submit by Monday Dec 13th 5pm via email to the grader Wei Wang ww42@njit.edu. 
Late submissions will not be accepted.