Question: Problem 2 . The DNA can be represented by a string of characters { A , C , G , T } . ( i

Problem 2. The DNA can be represented by a string of characters {A, C, G, T }.
(i) How many sequences of length n can we have with these 4 characters?
(ii)* How many sequences of these characters are there that have size n >4 in which the character T appears exactly 4 times

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!