<p>You are given two strings <code>a</code> and <code>b</code> that consist of lowercase letters. In one operation, you can change any character in <code>a</code> or <code>b</code> to <strong>any lowercase letter</strong>.</p>
<p>Your goal is to satisfy <strong>one</strong> of the following three conditions:</p>
<ul>
<li><strong>Every</strong> letter in <code>a</code> is <strong>strictly less</strong> than <strong>every</strong> letter in <code>b</code> in the alphabet.</li>
<li><strong>Every</strong> letter in <code>b</code> is <strong>strictly less</strong> than <strong>every</strong> letter in <code>a</code> in the alphabet.</li>
<li><strong>Both</strong><code>a</code> and <code>b</code> consist of <strong>only one</strong> distinct letter.</li>
</ul>
<p>Return <em>the <strong>minimum</strong> number of operations needed to achieve your goal.</em></p>