So now let's try to execute and now we would try to print letter mapping one here.
So once we have done this particular part.
Let us try doing this by saying, see, little mapping is equal to the simple sub Haikal Dot and let
those.
To.
Mapping one and Hillary would pass.
Little muffing won this case, then the text and candidate STF Index zero.
So let's also it on this text here and now if we see a little mapping one, so we get those letters
mapped over here like this.
OK, now, similarly, if you try and see see, little mapping is equal to against this simple sub hecho
dot and letters to the mapping one.
Here again we take Lettow mapping one and again the same text here, but this time we take candidate
still at the index one and again we try to see a little mapping one being printed.
So now here you see we get multiple letters wherever exist, not only of what we were doing, we were
taking this variable and this parameter C because of which we were not getting any values displayed.
Hence we have changed this variable with a value iStore.
And this is the variable where we have already stored the blank ciphertext mappings initially.
So notice that if you have seen that nothing much has changed in this letter mapping except that this
four letter mappings now for Z maps to also write in addition to now, that is because your add letter
and so adds a letter to the list only if the letter is already not there.
So now that we have this letter mapping for the full standard total cipher votes, we need to get a
new mapping for, say, for that the second cipher and then repeat the same process.
So now what we will do is let us do a little mapping tool that's equal to the agentic, simple sub hackle.
Don't get the blank cipher letter mapping.
So.
Let's just cooperate on this function.
Now, this is we are taking in for this is that a map in one?
And this is that the mapping tool that we are doing?
Then we take, let's say, for example, the vote part one, which is what do you make you're saying
make the world back on one.
Don't get battle out, and this time we passed the middle vote or the second road in this case, just
copy paste it over here and then now that is me, Vode.
Faten, Estie, or.
Of me, in this case, the is small, made a mistake by putting it Capitol, so we got this narrative
against the candidate of steel that's equal to a work world, Patton's.
Wore buttons, one got dignity, all buttons, and now here we are putting the more fat one that we
already have it, so we don't need to put it back individually.
Copy paste and values.
OK, ok.
For in sorry.
Our mistake.
Gameboard patterns.
One fine now after this, if you try to take this candidate a steer, you get now for values which have
this magic.
So now if we run a losing candidate or let's say for that case, for see in candidate last year and
here we take another see.
Now, in this case, we had taken normal letter mapping.
So let's take your letter mapping itself.
And that is equal to take samples of Hackle Dortch and letters.
To mapping one now here to use also to map in one, and he give us the little mapping tool now and again,
the same text available here in this.
And then we lost the value of C in this case.
And once that is done, if we try to take a mapping to in this case, we get this particular values.
Now, instead of entering a four number of times called your letters to mapping one for each of the
four candidates.
Also, we have written a loop in this case which goes through the list of the candidates and the particular
function on each of them.
This finishes this little map in four seconds followed also.
So now let us move on with the intersection part of this to say four letters in the next session.
That's it from the session.
Thank you very much.