Write a Python function that implements the following method
called fast_blast_score. 

def fast_blast_score(query, target):

	d_seq1 = {}
	for i = 0 to length of query {
		1. Let kmer be the substring of length 3 starting from
		position i in query.
		2. Insert pair (kmer,1) into the dictionary d_seq1
		3. i = i + 1
	}
	d_seq2 = {}
	for i = 0 to length of target {
		1. Let kmer be the substring of length 3 starting from
		position i in target.
		2. Insert pair (kmer,1) into the dictionary d_seq2
		3. i = i + 1
	}
	count = 0;
	k = list(keys(d_seq1)
	for i = 0 to length of k {
		1. If kmer pair (k[i],1) exists in dictionary d_seq2 then count = count + 1
	}
	return count
}

Use simple query and target examples that were given in class. 
Submit hardcopies of your program in class on Mar 4th, 2014.