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 Perl 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".

Submit your solution as a file called <firstname>HW10.pl to the teaching assistant Shikha Kaushal
(shikha.kaushal@gmail.com). Replace <firstname> with your first name.