Please write the code for the task in C++

Minimize the cost You are given two strings S and R, each of size N, containing lowercase English letters. You can do the following operations any number of times: - Type 0: Select any two indices i and j from 0 to n1 and swap S[i] with S[j]. This operation is free of cost. - Type 1: Select any index i from O to n1 and swap S[i] with any lowercase English letter. This operation costs 1 coin. Task Determine the minimum cost to make string S equal to R. Note: O-based indexing is followed. Example Assumptions - N=5 - S= "abdfa" - R= "abcde" Approach The required operations are