1. Question 1 Which type of algorithm trades accuracy for speed in order to find an approximate solution? 1 point Machine learning algorithm Heuristic Brute force algorithm Greedy algorithm Dynamic programming algorithm 2. Question 2 True or false: a motif of lowest score with respect to a collection of strings must appear as a substring of one of the strings. 1 point True False 3. Question 3 Which of the following RNA strings could translate into the amino acid string PRTEIN? (Select all that apply.) 1 point CCCAGUACCGAAAUUAAC CCCAGGACUGAGAUCAAU CCGAGGACCGAAAUCAAC CCAAGUACAGAGAUUAAC 4. Question 4 Consider the following profile matrix: A: 0.4 0.3 0.0 0.1 0.0 0.9 C: 0.2 0.3 0.0 0.4 0.0 0.1 G: 0.1 0.3 1.0 0.1 0.5 0.0 T: 0.3 0.1 0.0 0.4 0.5 0.0 Which of the following strings is a consensus string for this profile matrix? (Select all that apply.) 1 point AAGCCA TCGCGA AAGTGA AAGCTA AGGTCA AGGTGA 5. Question 5 Consider the following profile matrix Profile: A: 0.4 0.3 0.0 0.1 0.0 0.9 C: 0.2 0.3 0.0 0.4 0.0 0.1 G: 0.1 0.3 1.0 0.1 0.5 0.0 T: 0.3 0.1 0.0 0.4 0.5 0.0 Compute Pr(GAGCTA|Profile). (Express your answer as a decimal and do not round your answer more than 5 decimal places.) 1 point Enter answer here 6. Question 6 (Fill in the blank) The ___ serves as the cell's timekeeper.