Now, after this, if is solved, then it cannot possibly be a potential decryption letter for a different
ciphertext, so we should remove it from those other from the list.
So now, again, we create a formal appeal saying so for the Saiful letter, one in letters is OK,
we take a variable one in your solved.
Let us one and we will run this for loop and check if the length of letter mapping one at the index
of Saiful letter one and if this is not equal to one and your S1 in the letter mapping one at the index
of Saiful letter one.
Then we open up this package and now in this we create see the letter
mapping one and the index of Saifullah to one dot.
Now we use to remove the value of S1.
OK, and then again we check if the length of your letter mapping one at the index of Saifullah to one.
OK, if it is equal to one again here a new letter is now solved.
So the loop again.
So now here we are again giving the loop again through.
OK.
And finally.
At the end, we are to return the value of letter mapping what now we move on to our main definition
that is Haak simple sub.
Now we have given here a simple sub one.
So assessment, OK, and here we are going to pass.
The message is still variable.
And now here we create the intersected map, one that's equal to we see the get blank, let's remove
this get blank cipher letter mapping.
So we're calling that particular method here.
OK, after we have called and we have stored the value there, then we create the civil war list and
that is equal to Synon.
Now, let us cooperate on this non Letrozole space battle.
So we are putting that reference there.
And in this, we are giving blank then nakama same message, SDR dot convert to Apple, not use split
metal.
After this we create a for loop for the Saiful one in our civil war list that we have created.
And that is our if we just look at it.
Now, say, philatelist.
STF for War List A.
And in this we open up the for loop and we get a new Saiful at the map and for each ciphertext vote
for that week of candidate mappers.
That's Equilar.
Do we call here again to get blank Saiful letter mapping one.
OK and the vote pattern we create see war pattern asdf that's equal.
Do we say make the war button so.
Let's use that over here.
OK, so now here we can just check out in this make war button if we just open it and open the matter
that we are creating is get more buttons on a stick and the filenames make war button one.
So now he will have to write down saying make war
button one dot.
We have the matter that is get more button still so that this get more button STF.
And in this we are passing the Saiful voter one.
OK, hence we need the files to be completed, then we check if the war button is or is not in your.
Now we want another five.
So let us close this and go forward.
Button five.
Let's open this in November, ok.
So if it does not there in war patterns one.
So that's right.
Not in war.
Batten's one dot all battles.
So here we have this all battles created.
So we are using that.
And for this, the final limits, war battles one.
OK, so if it is not, then in this visible column and we just give that the continual statement, this
war was not in our dictionary.
So we continue with the next part of it.
OK.
And after this after this continues, we move on to the next and we say for the candidate one in your
war
button, one got all factors in the index of Faqir War
button is OK in this VSC.
Add letters to mapping.
Now your way of creating add letters to mapping one.
So let us put down the same concept here.
OK, in this we are passing the candidate one candidate map one, then the Saiful vote one and we are
having now its candidate map estie out in this case.
Then we have the Saiful vote one and we have the candidate one.
So we pass all this and we security add letters to mapping.
OK, ok, so after this we continue for the next part of it and we see in the new mapping with the existing
intersected mapping.
So here we create intersected map one that's equal to intersect mappings.
In the second one, and here we pass the object of intercepted map.
One gift and the candidate map is OK, and then finally we give you your written statement and receive
it on the novel, calling your remove dissolve letters from mapping.
So we are returning that passing that the interactive map once, OK, now will continue in the next
session.
More, more on this program.
And we have to also write down the method for group with this little mappings and then give our main
method execution.
OK, so we'll continue this in the next session.
Thank you very much.