problem 2 please  Ans to problem 1 is  #include using namespace std;   vector  targetSum(vector  &a , int &target) { int n = a.size(); for(int i = 0 ; i < n - 1 ; i++) for(int j = i + 1 ; j < n ; j++) { if(a[i] + a[j] == target) return {i + 1 , j + 1}; } return {}; }   int main() { vector  a = {1 , 4 , 5 , 11 , 12}; int target = 9; for(int &x : targetSum(a , target)) cout << x << " "; cout << '\n'; }

Provide simple explanation

i am getting segmentation core dump. I don't know how to fix this please help. PLEASE HELP!!    #include <bits/stdc++.h> #define lli long long int #define pb push_back #define mod 1000000007 #define INF 1e18 #define SIZE 100001   using namespace std;   vector<lli> adj[SIZE];//adjacency list bool visited[SIZE];//used in dfs and bfs lli dist[SIZE],discover[SIZE],finish[SIZE];//dist for bfs,intime,outtime for dfs lli t = 1;//time used for the dfs   void dfs(lli s) { visited[s] =1;//making it visited discover[s] = t++;//assigning and incrementing time lli i,v; for(i =0; i <adj[s].size(); i++) { v = adj[s][i]; if(!visited[v])//if vertex is not visited then visit dfs(v); } finish[s] = t++;//assigning the outtime } int main() { lli u ,v,i,j,k,N = 0; pair<lli,lli> current;   ifstream iFile("input.txt");//reading the input file string str,num;   //read until the end of file while(!iFile.eof()) { getline(iFile,str);//read the current line stringstream ss; ss << str;…

Every data structure that we use in computer science has its weaknesses and strengthsHaving a full understanding of each will help make us better programmers!For this experiment, let's work with STL vectors and STL dequesFull requirements descriptions are found in the source code file Part 1Work with inserting elements at the front of a vector and a deque (30%) Part 2Work with inserting elements at the back of a vector and a deque (30%) Part 3Work with inserting elements in the middle, and removing elements from, a vector and a deque (40%) Please make sure to put your code specifically where it is asked for, and no where elseDo not modify any of the code you already see in the template file This C++ source code file is required to complete this problem