(e) Determine the recursive relationship and write the corresponding Scala function to determine the number of strings o
Posted: Fri Jul 08, 2022 6:44 am
(e) Determine the recursive relationship and write the corresponding Scala function to determine the number of strings of length n (using the alphabet (A,T,C,G)) - that do not have any consecutive characters.