input: Write a function to calculate the Jaccard similarity between two given strings, which is the size of the intersection divided by the size of the union of the sets of words in the strings. The function should split the strings into words, convert them into sets, and then compute the Jaccard similarity.
  assert get_jaccard_similarity("python programming", "java programming")==0.5
  assert get_jaccard_similarity("hello world", "hello there")==0.25
  assert get_jaccard_similarity("quick brown fox", "jumped over lazy dog")==0.0
  assert get_jaccard_similarity("same string", "same string")==1.0
  assert get_jaccard_similarity("completely different", "totally unrelated")==0.0
output: def get_jaccard_similarity(str1, str2):
      set1 = set(str1.split())
      set2 = set(str2.split())
      intersection = set1.intersection(set2)
      union = set1.union(set2)
      return len(intersection) / len(union)