Category: Uncategorised

Note: you can find the question paper on the BIO website Part A This problem can be solved simply using a recursive algorithm: function is_pat(string: String) -> bool if string.len() == 1 then return True else is_pat = False for i=0 to string.len() – 2 do let (first_half, second_half) = string.split_at(i) if NOT min(first_half) >…