1- (Palindrome) Wite a python program named palindrome.py to read the test.bct file contents and writes to the output file (output.tct) if the string on the file is a palindrome (ie, reads the same forwards and backwards) or not? If the string is palindrome, write true, otherwise write false to the output file (30 points) 2- (Wastson-Crick Complement) Write a python program named complement,py that takes a DNA string as argument and returns its Watson- Crick complement: replace A with T, C with G, and vice versa. All the characters in the DNA strings are all in upper case (30 points) $ python wc_complement.py ACTGACG TGACTGC 3- (Set Distance) The Jaccard Index measures the similarity between finite sample sets, and is defined as the size of the intersection divided by the size of the union of the sample sets: A UB Note that 0 SJ(A, B) S 1. The Jaccard distance, which measures similarity between sample sets, is complementary to the Jaccard index and is obtained by subtracting the Jaccard index from 1 dj (A, B) 1-J(A.B) Write a python program named set_distance.py which retums the Jaccard distance of two sets. This jaccard_index and jaccard_distance that takes two sets A and B as arguments and retum their Jaccard index and distance respectively (40 points) s program includes two functions named $ python set distance.py "b, c" "a, b, c, d" 0.5 $ python set.distance.py "7, 3, 2, 4, 1" 4, 1, 9, 7, 5" 0.571428571429