chore:<Image> 404 image add

Author: raj-rathod

src/app/core/algorithms/backtracking-meta-data.ts

@@ -17,7 +17,7 @@ const backtracking = {
     at 'A' and we divided our problem into three smaller sub-probelms 'B', 'D' and 'F'. And using this sub-problem, we have three 
     possible path to get to our solution -- 'C', 'E', & 'G'.`,
 
-    example:'assets/ds-image/backtracking.jpg',
+    example:'assets/ds-image/DSA1.jpg',
 
     properties:[
         `A backtracking algorithm uses the depth-first search method. When it starts exploring the solutions, a bounding function is 

src/app/core/algorithms/greedy-meta-data.ts

@@ -8,7 +8,7 @@ const greedyData = {
    This algorithm may not produce the best result for all the problems. It's because it always goes for the local best 
    choice to produce the global best result.
    `,
-   example: 'assets/ds-image/greedy.jpg',
+   example: 'assets/ds-image/DSA1.jpg',
    properties:[
     `<b>Greedy Choice Property:</b> If an optimal solution to the problem can be found by choosing the best choice at 
     each step without reconsidering the previous steps once chosen, the problem can be solved using a greedy approach. 

src/app/core/algorithms/sorting-meta-data.ts

@@ -58,8 +58,8 @@ const selectionSortData = {
     Initially, the sorted part is empty and the unsorted part is the entire list. <br>
     The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes 
     a part of the sorted array. This process continues moving unsorted array boundary by one element to the right.`,
-    flowChart:"assets/ds-image/selection-sort.jpg",
-    explainImage:"assets/ds-image/explainImage.jpg",
+    flowChart:"assets/ds-image/DSA1.jpg",
+    explainImage:"assets/ds-image/DSA1.jpg",
     workingProcedure:[
         'Initialize minimum value(minValue) to location 0.',
         'Traverse the array to find the minimum element in the array.',