sort_helper_QZ implementation

write a function called sort_helper_QZ that uses your function from part a) so that if a vector of strings v is passed into sort like this:

std::sort(v.begin(), v.end(), sort_helper_QZ) 

the vector would be sorted from words with the highest counts of q and/or z to lowest, with ties broken by lexicographical sorting. For example:

Before sorting... apple has 0 Qs and/or Zs. zap has 1 Qs and/or Zs. quizzical has 3 Qs and/or Zs. quartz has 2 Qs and/or Zs. quack has 1 Qs and/or Zs. After sorting... quizzical has 3 Qs and/or Zs. quartz has 2 Qs and/or Zs. quack has 1 Qs and/or Zs. zap has 1 Qs and/or Zs. apple has 0 Qs and/or Zs. 

Sample solution: 10 line