4. a. In molecular biology, DNAS and proteins can be represented as a sequence of alphabets. DNA sequences consist of A, T, G, C representing nucleobases adenine, thymine, guanine and cytosine....

ans only b

Extracted text: 4. a. In molecular biology, DNAS and proteins can be represented as a sequence of alphabets. DNA sequences consist of A, T, G, C representing nucleobases adenine, thymine, guanine and cytosine. Proteins consist of 20 different letters indicating 20 different amino acids. Suppose you are going to be recruited as a research fellow in a Bio-informatics lab where the recruiters need to compare your DNA characteristics for some reasons with their most successful researcher's DNA. If they observe that highest nucleobase subsequence matching score is more than 5, primarily you will be considered as a valid candidate for their lab. Let's say the part of DNA Sequence of you and the researcher are AATTGCGG, and GACTTACGA respectively. Now your task is to find a suitable algorithm to help the recruiters to measure your eligibility, and do the necessary task to convey them the list of highest matched nucleobases. b. Which algorithm design technique you have followed to solve the described problem in (a)? Give some reasons. Also calculate the worst case complexity of your algorithm.