Computational cost of making Anagrams from two strings using symmetric difference in python

Question

Given two strings a, and b of lengths |a| and |b|, compute the number of elements that should be deleted in total such that a and b are anagrams of each other.

The an