Remove information that indexes cannot be created for TStore IMaps (#787

)

* Remove information that indexes cannot be created for TStore IMaps

Also fix some typos.

* Fix indentation in YAML example

docs/modules/query/pages/indexing-maps.adoc

@@ -4,8 +4,6 @@
 
 {description}
 
-NOTE: You cannot yet create indexes on maps that have xref:tiered-storage:overview.adoc[Tiered Storage] enabled.
-
 When members run queries, they iterate through all their owned entries and find the ones that match the query. Depending on the number of entries in the map, it may take a long time for a member to find the entry that matches the query. Indexes allow members to find entries faster and avoid searching through unnecessary entries. For example, if you do `active AND age < 30` query, you can add an index for the `active` and
 `age` fields.
 
@@ -55,8 +53,8 @@ hazelcast:
     employees:
       indexes:
         - type: HASH
-            attributes:
-              - "name"
+          attributes:
+            - "name"
         - attributes:
             - "age"
 ----
@@ -125,7 +123,7 @@ To create an index for a map, you must specify the name of the fields that you w
 
 NOTE: If the values of the fields are non-primitive types, they must implement the `Comparable` interface.
 
-=== Using the `this`` Keyword as an Attribute
+=== Using the `this` Keyword as an Attribute
 
 The `this` keyword acts on the value of a map entry to access properties on it. For example, if a value contains an `employee` object with the `name` field, you can access that field, using `this.name`. Typically,
 you do not need to specify the `this` keyword because its presence is assumed if the special attribute `__key` is not specified. As a result, `this.name` and `name` are equivalent.
@@ -856,7 +854,7 @@ SQL does not currently support arrays.
 See xref:querying-collections-and-arrays.adoc#indexing-in-collections-and-arrays[Indexing in Collections and Arrays section]
 for more details.
 
-==== Bitmap Index Querying
+=== Bitmap Index Querying
 
 Bitmap index matching and selection for queries are performed
 automatically. No special treatment is required. The querying can be