Write in C++ Find the positions of all strings equal to a given string in a vector of strings. Adapt the algorithm from the "Common Array Algorithms" section. Instead of stopping at the first match, collect all positions.

#include #include using namespace std;

/** Finds the positions of all strings equal to a given string in an array list of strings. @param words a vector of strings @param searched_word the word to search for @return a vector of all matching positions */

/* Your code goes here */ find_all(/* Your code goes here */ words, /* Your code goes here */ searched_word) { /* Your code goes here */ }

#include #include #include using namespace std;

ostream& operator& v) { out 0) { out find_all(vector, string);

int main() { vector words; words.push_back("how"); words.push_back("much"); words.push_back("wood"); words.push_back("would"); words.push_back("a"); words.push_back("wood"); words.push_back("chuck"); words.push_back("chuck"); words.push_back("if"); words.push_back("a"); words.push_back("wood"); words.push_back("chuck"); words.push_back("could"); words.push_back("chuck"); words.push_back("wood"); cout Find the positions of all strings equal to a given string in a vector of strings. Adapt the algorithm from the "Common Array Algorithms" section. Instead of stopping at the first match, collect all positions